./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e6b9f2-554d-4fde-a6cb-4e1e82d39400/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e6b9f2-554d-4fde-a6cb-4e1e82d39400/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e6b9f2-554d-4fde-a6cb-4e1e82d39400/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e6b9f2-554d-4fde-a6cb-4e1e82d39400/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e6b9f2-554d-4fde-a6cb-4e1e82d39400/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e6b9f2-554d-4fde-a6cb-4e1e82d39400/bin/uautomizer-DQz5hQGWxF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b7b455ef4c5fa587af8d02bd246c19891a72a51abfbb562aebbb342c1c7fae8 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 07:25:45,765 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 07:25:45,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 07:25:45,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 07:25:45,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 07:25:45,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 07:25:45,805 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 07:25:45,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 07:25:45,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 07:25:45,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 07:25:45,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 07:25:45,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 07:25:45,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 07:25:45,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 07:25:45,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 07:25:45,821 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 07:25:45,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 07:25:45,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 07:25:45,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 07:25:45,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 07:25:45,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 07:25:45,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 07:25:45,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 07:25:45,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 07:25:45,842 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 07:25:45,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 07:25:45,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 07:25:45,844 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 07:25:45,845 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 07:25:45,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 07:25:45,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 07:25:45,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 07:25:45,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 07:25:45,850 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 07:25:45,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 07:25:45,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 07:25:45,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 07:25:45,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 07:25:45,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 07:25:45,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 07:25:45,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 07:25:45,857 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e6b9f2-554d-4fde-a6cb-4e1e82d39400/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-20 07:25:45,899 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 07:25:45,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 07:25:45,901 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 07:25:45,902 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 07:25:45,903 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 07:25:45,903 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 07:25:45,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 07:25:45,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 07:25:45,904 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 07:25:45,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 07:25:45,906 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 07:25:45,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 07:25:45,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 07:25:45,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 07:25:45,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 07:25:45,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 07:25:45,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 07:25:45,907 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 07:25:45,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 07:25:45,908 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 07:25:45,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 07:25:45,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 07:25:45,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 07:25:45,909 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 07:25:45,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:25:45,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 07:25:45,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 07:25:45,910 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 07:25:45,910 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 07:25:45,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 07:25:45,910 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 07:25:45,910 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 07:25:45,911 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 07:25:45,911 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 07:25:45,911 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_b3e6b9f2-554d-4fde-a6cb-4e1e82d39400/bin/uautomizer-DQz5hQGWxF/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_b3e6b9f2-554d-4fde-a6cb-4e1e82d39400/bin/uautomizer-DQz5hQGWxF 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 ! call(reach_error())) ) 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 -> 2b7b455ef4c5fa587af8d02bd246c19891a72a51abfbb562aebbb342c1c7fae8 [2021-11-20 07:25:46,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 07:25:46,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 07:25:46,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 07:25:46,231 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 07:25:46,232 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 07:25:46,234 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e6b9f2-554d-4fde-a6cb-4e1e82d39400/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i [2021-11-20 07:25:46,307 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e6b9f2-554d-4fde-a6cb-4e1e82d39400/bin/uautomizer-DQz5hQGWxF/data/13e89c983/ea1efe64f35c416fb9d45c365f644b55/FLAG4a4df7979 [2021-11-20 07:25:46,887 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 07:25:46,888 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e6b9f2-554d-4fde-a6cb-4e1e82d39400/sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i [2021-11-20 07:25:46,905 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e6b9f2-554d-4fde-a6cb-4e1e82d39400/bin/uautomizer-DQz5hQGWxF/data/13e89c983/ea1efe64f35c416fb9d45c365f644b55/FLAG4a4df7979 [2021-11-20 07:25:47,184 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e6b9f2-554d-4fde-a6cb-4e1e82d39400/bin/uautomizer-DQz5hQGWxF/data/13e89c983/ea1efe64f35c416fb9d45c365f644b55 [2021-11-20 07:25:47,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 07:25:47,190 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 07:25:47,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 07:25:47,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 07:25:47,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 07:25:47,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:25:47" (1/1) ... [2021-11-20 07:25:47,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b86432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:47, skipping insertion in model container [2021-11-20 07:25:47,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:25:47" (1/1) ... [2021-11-20 07:25:47,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 07:25:47,291 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 07:25:47,518 WARN L230 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_b3e6b9f2-554d-4fde-a6cb-4e1e82d39400/sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i[949,962] [2021-11-20 07:25:47,836 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:25:47,845 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 07:25:47,863 WARN L230 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_b3e6b9f2-554d-4fde-a6cb-4e1e82d39400/sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i[949,962] [2021-11-20 07:25:47,909 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:25:47,956 INFO L208 MainTranslator]: Completed translation [2021-11-20 07:25:47,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:47 WrapperNode [2021-11-20 07:25:47,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 07:25:47,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 07:25:47,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 07:25:47,958 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 07:25:47,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:47" (1/1) ... [2021-11-20 07:25:47,992 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:47" (1/1) ... [2021-11-20 07:25:48,033 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 275 [2021-11-20 07:25:48,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 07:25:48,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 07:25:48,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 07:25:48,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 07:25:48,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:47" (1/1) ... [2021-11-20 07:25:48,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:47" (1/1) ... [2021-11-20 07:25:48,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:47" (1/1) ... [2021-11-20 07:25:48,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:47" (1/1) ... [2021-11-20 07:25:48,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:47" (1/1) ... [2021-11-20 07:25:48,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:47" (1/1) ... [2021-11-20 07:25:48,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:47" (1/1) ... [2021-11-20 07:25:48,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 07:25:48,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 07:25:48,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 07:25:48,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 07:25:48,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:47" (1/1) ... [2021-11-20 07:25:48,081 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:25:48,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e6b9f2-554d-4fde-a6cb-4e1e82d39400/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:25:48,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e6b9f2-554d-4fde-a6cb-4e1e82d39400/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 07:25:48,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e6b9f2-554d-4fde-a6cb-4e1e82d39400/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 07:25:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 07:25:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-20 07:25:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 07:25:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 07:25:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 07:25:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-11-20 07:25:48,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-11-20 07:25:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-11-20 07:25:48,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-11-20 07:25:48,180 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-11-20 07:25:48,180 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-11-20 07:25:48,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 07:25:48,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-20 07:25:48,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 07:25:48,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 07:25:48,182 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-20 07:25:48,404 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 07:25:48,406 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 07:25:49,146 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 07:25:49,607 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 07:25:49,607 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-20 07:25:49,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:25:49 BoogieIcfgContainer [2021-11-20 07:25:49,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 07:25:49,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 07:25:49,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 07:25:49,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 07:25:49,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:25:47" (1/3) ... [2021-11-20 07:25:49,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e972b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:25:49, skipping insertion in model container [2021-11-20 07:25:49,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:47" (2/3) ... [2021-11-20 07:25:49,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e972b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:25:49, skipping insertion in model container [2021-11-20 07:25:49,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:25:49" (3/3) ... [2021-11-20 07:25:49,624 INFO L111 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2021-11-20 07:25:49,630 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-20 07:25:49,631 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 07:25:49,631 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-20 07:25:49,631 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-20 07:25:49,687 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,687 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,687 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,687 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,688 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,688 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,688 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,688 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,689 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,689 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,690 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,690 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,691 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,691 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,691 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,692 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,692 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,692 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,693 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,694 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,694 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,695 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,697 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,697 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,697 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,698 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,699 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,699 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,699 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,699 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,699 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,700 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,700 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,700 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,700 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,700 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,701 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,701 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,701 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,701 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,702 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,702 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,702 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,702 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,703 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,703 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,704 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,704 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,704 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,705 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,705 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,705 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,705 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,706 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,706 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,706 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,706 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,707 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,707 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,707 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,708 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,709 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,709 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,709 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,709 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,710 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,710 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,710 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,711 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,711 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,711 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,711 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,711 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,712 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,712 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,712 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,712 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,713 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,713 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,715 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,719 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,719 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,720 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,720 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,720 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,721 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,728 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,728 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,729 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,734 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,734 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,734 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,734 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,734 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,735 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,735 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,737 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,737 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,738 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,738 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,738 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,738 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,739 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,739 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,739 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,739 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,739 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,739 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,740 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,740 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:25:49,740 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-20 07:25:49,834 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 07:25:49,850 INFO L339 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 07:25:49,850 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-20 07:25:49,875 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2021-11-20 07:25:49,927 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-11-20 07:25:49,927 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-20 07:25:49,932 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2021-11-20 07:25:49,932 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2021-11-20 07:25:49,937 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2021-11-20 07:25:49,953 INFO L129 PetriNetUnfolder]: 0/60 cut-off events. [2021-11-20 07:25:49,953 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-20 07:25:49,953 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:25:49,954 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:25:49,955 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:25:49,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:25:49,961 INFO L85 PathProgramCache]: Analyzing trace with hash -284253320, now seen corresponding path program 1 times [2021-11-20 07:25:49,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:25:49,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082047920] [2021-11-20 07:25:49,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:25:49,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:25:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:25:50,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:25:50,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:25:50,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082047920] [2021-11-20 07:25:50,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082047920] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:25:50,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:25:50,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 07:25:50,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534185257] [2021-11-20 07:25:50,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:25:50,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:25:50,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:25:50,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:25:50,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:25:50,401 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 115 [2021-11-20 07:25:50,405 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 112 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:50,405 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:25:50,406 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 115 [2021-11-20 07:25:50,407 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:25:50,659 INFO L129 PetriNetUnfolder]: 57/324 cut-off events. [2021-11-20 07:25:50,659 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-11-20 07:25:50,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 324 events. 57/324 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1316 event pairs, 11 based on Foata normal form. 12/319 useless extension candidates. Maximal degree in co-relation 397. Up to 75 conditions per place. [2021-11-20 07:25:50,667 INFO L132 encePairwiseOnDemand]: 110/115 looper letters, 13 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2021-11-20 07:25:50,667 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 113 transitions, 268 flow [2021-11-20 07:25:50,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:25:50,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-20 07:25:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2021-11-20 07:25:50,689 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.936231884057971 [2021-11-20 07:25:50,690 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2021-11-20 07:25:50,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2021-11-20 07:25:50,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:25:50,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2021-11-20 07:25:50,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:50,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:50,719 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:50,722 INFO L186 Difference]: Start difference. First operand has 120 places, 112 transitions, 233 flow. Second operand 3 states and 323 transitions. [2021-11-20 07:25:50,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 113 transitions, 268 flow [2021-11-20 07:25:50,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 113 transitions, 264 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-11-20 07:25:50,737 INFO L242 Difference]: Finished difference. Result has 117 places, 108 transitions, 226 flow [2021-11-20 07:25:50,740 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=117, PETRI_TRANSITIONS=108} [2021-11-20 07:25:50,746 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places. [2021-11-20 07:25:50,746 INFO L470 AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 226 flow [2021-11-20 07:25:50,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:50,746 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:25:50,747 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:25:50,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 07:25:50,747 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:25:50,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:25:50,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2047081111, now seen corresponding path program 1 times [2021-11-20 07:25:50,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:25:50,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730629293] [2021-11-20 07:25:50,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:25:50,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:25:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:25:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:25:51,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:25:51,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730629293] [2021-11-20 07:25:51,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730629293] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:25:51,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:25:51,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-20 07:25:51,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790116039] [2021-11-20 07:25:51,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:25:51,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 07:25:51,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:25:51,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 07:25:51,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-11-20 07:25:51,307 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2021-11-20 07:25:51,309 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 108 transitions, 226 flow. Second operand has 10 states, 10 states have (on average 92.4) internal successors, (924), 10 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:51,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:25:51,313 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2021-11-20 07:25:51,314 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:25:52,082 INFO L129 PetriNetUnfolder]: 396/1298 cut-off events. [2021-11-20 07:25:52,083 INFO L130 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2021-11-20 07:25:52,089 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2040 conditions, 1298 events. 396/1298 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9075 event pairs, 169 based on Foata normal form. 0/1254 useless extension candidates. Maximal degree in co-relation 1985. Up to 374 conditions per place. [2021-11-20 07:25:52,094 INFO L132 encePairwiseOnDemand]: 102/115 looper letters, 20 selfloop transitions, 11 changer transitions 58/166 dead transitions. [2021-11-20 07:25:52,095 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 166 transitions, 518 flow [2021-11-20 07:25:52,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 07:25:52,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-11-20 07:25:52,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1446 transitions. [2021-11-20 07:25:52,101 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8382608695652174 [2021-11-20 07:25:52,101 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1446 transitions. [2021-11-20 07:25:52,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1446 transitions. [2021-11-20 07:25:52,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:25:52,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1446 transitions. [2021-11-20 07:25:52,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 96.4) internal successors, (1446), 15 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:52,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 115.0) internal successors, (1840), 16 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:52,115 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 115.0) internal successors, (1840), 16 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:52,116 INFO L186 Difference]: Start difference. First operand has 117 places, 108 transitions, 226 flow. Second operand 15 states and 1446 transitions. [2021-11-20 07:25:52,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 166 transitions, 518 flow [2021-11-20 07:25:52,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 166 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-11-20 07:25:52,121 INFO L242 Difference]: Finished difference. Result has 140 places, 103 transitions, 295 flow [2021-11-20 07:25:52,122 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=295, PETRI_PLACES=140, PETRI_TRANSITIONS=103} [2021-11-20 07:25:52,123 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 20 predicate places. [2021-11-20 07:25:52,123 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 103 transitions, 295 flow [2021-11-20 07:25:52,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 92.4) internal successors, (924), 10 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:52,124 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:25:52,124 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:25:52,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 07:25:52,125 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:25:52,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:25:52,126 INFO L85 PathProgramCache]: Analyzing trace with hash 527815701, now seen corresponding path program 1 times [2021-11-20 07:25:52,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:25:52,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444382799] [2021-11-20 07:25:52,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:25:52,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:25:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:25:52,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:25:52,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:25:52,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444382799] [2021-11-20 07:25:52,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444382799] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:25:52,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:25:52,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-20 07:25:52,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135240897] [2021-11-20 07:25:52,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:25:52,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 07:25:52,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:25:52,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 07:25:52,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-20 07:25:52,468 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2021-11-20 07:25:52,469 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 103 transitions, 295 flow. Second operand has 9 states, 9 states have (on average 92.66666666666667) internal successors, (834), 9 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:52,469 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:25:52,470 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2021-11-20 07:25:52,470 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:25:53,026 INFO L129 PetriNetUnfolder]: 264/698 cut-off events. [2021-11-20 07:25:53,026 INFO L130 PetriNetUnfolder]: For 1615/1685 co-relation queries the response was YES. [2021-11-20 07:25:53,031 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2207 conditions, 698 events. 264/698 cut-off events. For 1615/1685 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3757 event pairs, 145 based on Foata normal form. 15/686 useless extension candidates. Maximal degree in co-relation 2137. Up to 313 conditions per place. [2021-11-20 07:25:53,039 INFO L132 encePairwiseOnDemand]: 103/115 looper letters, 26 selfloop transitions, 13 changer transitions 29/145 dead transitions. [2021-11-20 07:25:53,039 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 145 transitions, 704 flow [2021-11-20 07:25:53,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 07:25:53,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-11-20 07:25:53,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1152 transitions. [2021-11-20 07:25:53,044 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8347826086956521 [2021-11-20 07:25:53,044 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1152 transitions. [2021-11-20 07:25:53,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1152 transitions. [2021-11-20 07:25:53,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:25:53,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1152 transitions. [2021-11-20 07:25:53,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 96.0) internal successors, (1152), 12 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:53,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 115.0) internal successors, (1495), 13 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:53,056 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 115.0) internal successors, (1495), 13 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:53,056 INFO L186 Difference]: Start difference. First operand has 140 places, 103 transitions, 295 flow. Second operand 12 states and 1152 transitions. [2021-11-20 07:25:53,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 145 transitions, 704 flow [2021-11-20 07:25:53,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 145 transitions, 686 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-11-20 07:25:53,076 INFO L242 Difference]: Finished difference. Result has 133 places, 111 transitions, 421 flow [2021-11-20 07:25:53,076 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=421, PETRI_PLACES=133, PETRI_TRANSITIONS=111} [2021-11-20 07:25:53,079 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 13 predicate places. [2021-11-20 07:25:53,079 INFO L470 AbstractCegarLoop]: Abstraction has has 133 places, 111 transitions, 421 flow [2021-11-20 07:25:53,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 92.66666666666667) internal successors, (834), 9 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:53,080 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:25:53,081 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:25:53,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 07:25:53,081 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:25:53,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:25:53,083 INFO L85 PathProgramCache]: Analyzing trace with hash -855479351, now seen corresponding path program 1 times [2021-11-20 07:25:53,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:25:53,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537313366] [2021-11-20 07:25:53,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:25:53,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:25:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:25:53,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:25:53,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:25:53,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537313366] [2021-11-20 07:25:53,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537313366] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:25:53,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:25:53,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-20 07:25:53,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457209412] [2021-11-20 07:25:53,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:25:53,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 07:25:53,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:25:53,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 07:25:53,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-20 07:25:53,440 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2021-11-20 07:25:53,441 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 111 transitions, 421 flow. Second operand has 10 states, 10 states have (on average 92.5) internal successors, (925), 10 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:53,442 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:25:53,442 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2021-11-20 07:25:53,442 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:25:53,968 INFO L129 PetriNetUnfolder]: 226/624 cut-off events. [2021-11-20 07:25:53,968 INFO L130 PetriNetUnfolder]: For 3144/3223 co-relation queries the response was YES. [2021-11-20 07:25:53,973 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2424 conditions, 624 events. 226/624 cut-off events. For 3144/3223 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3287 event pairs, 62 based on Foata normal form. 18/619 useless extension candidates. Maximal degree in co-relation 2345. Up to 230 conditions per place. [2021-11-20 07:25:53,979 INFO L132 encePairwiseOnDemand]: 106/115 looper letters, 33 selfloop transitions, 8 changer transitions 25/143 dead transitions. [2021-11-20 07:25:53,979 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 143 transitions, 807 flow [2021-11-20 07:25:53,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 07:25:53,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-11-20 07:25:53,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1148 transitions. [2021-11-20 07:25:53,984 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8318840579710145 [2021-11-20 07:25:53,984 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1148 transitions. [2021-11-20 07:25:53,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1148 transitions. [2021-11-20 07:25:53,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:25:53,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1148 transitions. [2021-11-20 07:25:53,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 95.66666666666667) internal successors, (1148), 12 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:53,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 115.0) internal successors, (1495), 13 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:53,994 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 115.0) internal successors, (1495), 13 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:53,994 INFO L186 Difference]: Start difference. First operand has 133 places, 111 transitions, 421 flow. Second operand 12 states and 1148 transitions. [2021-11-20 07:25:53,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 143 transitions, 807 flow [2021-11-20 07:25:54,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 143 transitions, 763 flow, removed 20 selfloop flow, removed 5 redundant places. [2021-11-20 07:25:54,005 INFO L242 Difference]: Finished difference. Result has 140 places, 111 transitions, 424 flow [2021-11-20 07:25:54,006 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=424, PETRI_PLACES=140, PETRI_TRANSITIONS=111} [2021-11-20 07:25:54,007 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 20 predicate places. [2021-11-20 07:25:54,007 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 111 transitions, 424 flow [2021-11-20 07:25:54,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 92.5) internal successors, (925), 10 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:54,008 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:25:54,008 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:25:54,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 07:25:54,009 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:25:54,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:25:54,010 INFO L85 PathProgramCache]: Analyzing trace with hash 454078418, now seen corresponding path program 1 times [2021-11-20 07:25:54,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:25:54,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404308631] [2021-11-20 07:25:54,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:25:54,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:25:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:25:54,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:25:54,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:25:54,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404308631] [2021-11-20 07:25:54,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404308631] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:25:54,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:25:54,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 07:25:54,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064177830] [2021-11-20 07:25:54,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:25:54,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:25:54,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:25:54,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:25:54,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:25:54,139 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2021-11-20 07:25:54,140 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 111 transitions, 424 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:54,140 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:25:54,141 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2021-11-20 07:25:54,141 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:25:54,826 INFO L129 PetriNetUnfolder]: 931/1914 cut-off events. [2021-11-20 07:25:54,827 INFO L130 PetriNetUnfolder]: For 9180/9192 co-relation queries the response was YES. [2021-11-20 07:25:54,839 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6649 conditions, 1914 events. 931/1914 cut-off events. For 9180/9192 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12434 event pairs, 47 based on Foata normal form. 8/1881 useless extension candidates. Maximal degree in co-relation 6567. Up to 552 conditions per place. [2021-11-20 07:25:54,854 INFO L132 encePairwiseOnDemand]: 105/115 looper letters, 54 selfloop transitions, 13 changer transitions 43/190 dead transitions. [2021-11-20 07:25:54,855 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 190 transitions, 1181 flow [2021-11-20 07:25:54,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 07:25:54,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-11-20 07:25:54,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 992 transitions. [2021-11-20 07:25:54,859 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8626086956521739 [2021-11-20 07:25:54,859 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 992 transitions. [2021-11-20 07:25:54,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 992 transitions. [2021-11-20 07:25:54,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:25:54,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 992 transitions. [2021-11-20 07:25:54,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.2) internal successors, (992), 10 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:54,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:54,868 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:54,868 INFO L186 Difference]: Start difference. First operand has 140 places, 111 transitions, 424 flow. Second operand 10 states and 992 transitions. [2021-11-20 07:25:54,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 190 transitions, 1181 flow [2021-11-20 07:25:54,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 190 transitions, 1071 flow, removed 36 selfloop flow, removed 13 redundant places. [2021-11-20 07:25:54,881 INFO L242 Difference]: Finished difference. Result has 136 places, 119 transitions, 462 flow [2021-11-20 07:25:54,881 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=462, PETRI_PLACES=136, PETRI_TRANSITIONS=119} [2021-11-20 07:25:54,882 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 16 predicate places. [2021-11-20 07:25:54,882 INFO L470 AbstractCegarLoop]: Abstraction has has 136 places, 119 transitions, 462 flow [2021-11-20 07:25:54,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:54,883 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:25:54,883 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:25:54,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-20 07:25:54,884 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:25:54,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:25:54,884 INFO L85 PathProgramCache]: Analyzing trace with hash 63924199, now seen corresponding path program 1 times [2021-11-20 07:25:54,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:25:54,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835128362] [2021-11-20 07:25:54,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:25:54,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:25:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:25:55,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:25:55,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:25:55,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835128362] [2021-11-20 07:25:55,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835128362] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:25:55,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:25:55,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:25:55,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008749909] [2021-11-20 07:25:55,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:25:55,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:25:55,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:25:55,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:25:55,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:25:55,033 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2021-11-20 07:25:55,034 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 119 transitions, 462 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:55,035 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:25:55,035 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2021-11-20 07:25:55,035 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:25:55,754 INFO L129 PetriNetUnfolder]: 757/1672 cut-off events. [2021-11-20 07:25:55,754 INFO L130 PetriNetUnfolder]: For 7869/7891 co-relation queries the response was YES. [2021-11-20 07:25:55,764 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6355 conditions, 1672 events. 757/1672 cut-off events. For 7869/7891 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11210 event pairs, 45 based on Foata normal form. 46/1708 useless extension candidates. Maximal degree in co-relation 6277. Up to 305 conditions per place. [2021-11-20 07:25:55,772 INFO L132 encePairwiseOnDemand]: 105/115 looper letters, 61 selfloop transitions, 24 changer transitions 48/213 dead transitions. [2021-11-20 07:25:55,772 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 213 transitions, 1449 flow [2021-11-20 07:25:55,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 07:25:55,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-11-20 07:25:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1288 transitions. [2021-11-20 07:25:55,777 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8615384615384616 [2021-11-20 07:25:55,778 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1288 transitions. [2021-11-20 07:25:55,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1288 transitions. [2021-11-20 07:25:55,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:25:55,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1288 transitions. [2021-11-20 07:25:55,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 99.07692307692308) internal successors, (1288), 13 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:55,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 115.0) internal successors, (1610), 14 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:55,787 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 115.0) internal successors, (1610), 14 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:55,788 INFO L186 Difference]: Start difference. First operand has 136 places, 119 transitions, 462 flow. Second operand 13 states and 1288 transitions. [2021-11-20 07:25:55,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 213 transitions, 1449 flow [2021-11-20 07:25:55,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 213 transitions, 1433 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-11-20 07:25:55,808 INFO L242 Difference]: Finished difference. Result has 152 places, 132 transitions, 645 flow [2021-11-20 07:25:55,809 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=645, PETRI_PLACES=152, PETRI_TRANSITIONS=132} [2021-11-20 07:25:55,810 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 32 predicate places. [2021-11-20 07:25:55,810 INFO L470 AbstractCegarLoop]: Abstraction has has 152 places, 132 transitions, 645 flow [2021-11-20 07:25:55,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:55,811 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:25:55,811 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:25:55,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-20 07:25:55,812 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:25:55,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:25:55,812 INFO L85 PathProgramCache]: Analyzing trace with hash 13405218, now seen corresponding path program 1 times [2021-11-20 07:25:55,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:25:55,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549619363] [2021-11-20 07:25:55,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:25:55,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:25:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:25:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:25:55,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:25:55,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549619363] [2021-11-20 07:25:55,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549619363] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:25:55,981 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:25:55,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-20 07:25:55,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081578905] [2021-11-20 07:25:55,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:25:55,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 07:25:55,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:25:55,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 07:25:55,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:25:55,983 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2021-11-20 07:25:55,984 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 132 transitions, 645 flow. Second operand has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:55,984 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:25:55,985 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2021-11-20 07:25:55,985 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:25:56,672 INFO L129 PetriNetUnfolder]: 650/1528 cut-off events. [2021-11-20 07:25:56,673 INFO L130 PetriNetUnfolder]: For 8914/8940 co-relation queries the response was YES. [2021-11-20 07:25:56,684 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6433 conditions, 1528 events. 650/1528 cut-off events. For 8914/8940 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 10636 event pairs, 59 based on Foata normal form. 26/1541 useless extension candidates. Maximal degree in co-relation 6348. Up to 267 conditions per place. [2021-11-20 07:25:56,691 INFO L132 encePairwiseOnDemand]: 105/115 looper letters, 53 selfloop transitions, 28 changer transitions 48/209 dead transitions. [2021-11-20 07:25:56,691 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 209 transitions, 1499 flow [2021-11-20 07:25:56,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-20 07:25:56,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-11-20 07:25:56,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1550 transitions. [2021-11-20 07:25:56,697 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.842391304347826 [2021-11-20 07:25:56,698 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1550 transitions. [2021-11-20 07:25:56,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1550 transitions. [2021-11-20 07:25:56,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:25:56,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1550 transitions. [2021-11-20 07:25:56,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 96.875) internal successors, (1550), 16 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:56,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 115.0) internal successors, (1955), 17 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:56,710 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 115.0) internal successors, (1955), 17 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:56,710 INFO L186 Difference]: Start difference. First operand has 152 places, 132 transitions, 645 flow. Second operand 16 states and 1550 transitions. [2021-11-20 07:25:56,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 209 transitions, 1499 flow [2021-11-20 07:25:56,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 209 transitions, 1402 flow, removed 37 selfloop flow, removed 5 redundant places. [2021-11-20 07:25:56,755 INFO L242 Difference]: Finished difference. Result has 169 places, 133 transitions, 658 flow [2021-11-20 07:25:56,756 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=658, PETRI_PLACES=169, PETRI_TRANSITIONS=133} [2021-11-20 07:25:56,757 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 49 predicate places. [2021-11-20 07:25:56,757 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 133 transitions, 658 flow [2021-11-20 07:25:56,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:56,758 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:25:56,758 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:25:56,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-20 07:25:56,758 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:25:56,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:25:56,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1294030252, now seen corresponding path program 1 times [2021-11-20 07:25:56,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:25:56,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804504641] [2021-11-20 07:25:56,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:25:56,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:25:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:25:56,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:25:56,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:25:56,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804504641] [2021-11-20 07:25:56,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804504641] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:25:56,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:25:56,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:25:56,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974717140] [2021-11-20 07:25:56,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:25:56,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:25:56,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:25:56,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:25:56,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:25:56,921 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2021-11-20 07:25:56,922 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 133 transitions, 658 flow. Second operand has 7 states, 7 states have (on average 94.57142857142857) internal successors, (662), 7 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:56,922 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:25:56,922 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2021-11-20 07:25:56,923 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:25:57,388 INFO L129 PetriNetUnfolder]: 225/1251 cut-off events. [2021-11-20 07:25:57,389 INFO L130 PetriNetUnfolder]: For 3322/3396 co-relation queries the response was YES. [2021-11-20 07:25:57,403 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3984 conditions, 1251 events. 225/1251 cut-off events. For 3322/3396 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 12000 event pairs, 17 based on Foata normal form. 2/1172 useless extension candidates. Maximal degree in co-relation 3911. Up to 173 conditions per place. [2021-11-20 07:25:57,409 INFO L132 encePairwiseOnDemand]: 109/115 looper letters, 31 selfloop transitions, 1 changer transitions 18/159 dead transitions. [2021-11-20 07:25:57,410 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 159 transitions, 931 flow [2021-11-20 07:25:57,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:25:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-11-20 07:25:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 678 transitions. [2021-11-20 07:25:57,414 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8422360248447205 [2021-11-20 07:25:57,414 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 678 transitions. [2021-11-20 07:25:57,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 678 transitions. [2021-11-20 07:25:57,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:25:57,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 678 transitions. [2021-11-20 07:25:57,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:57,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:57,421 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:57,422 INFO L186 Difference]: Start difference. First operand has 169 places, 133 transitions, 658 flow. Second operand 7 states and 678 transitions. [2021-11-20 07:25:57,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 159 transitions, 931 flow [2021-11-20 07:25:57,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 159 transitions, 781 flow, removed 45 selfloop flow, removed 21 redundant places. [2021-11-20 07:25:57,479 INFO L242 Difference]: Finished difference. Result has 156 places, 133 transitions, 557 flow [2021-11-20 07:25:57,480 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=557, PETRI_PLACES=156, PETRI_TRANSITIONS=133} [2021-11-20 07:25:57,483 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 36 predicate places. [2021-11-20 07:25:57,483 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 133 transitions, 557 flow [2021-11-20 07:25:57,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.57142857142857) internal successors, (662), 7 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:57,484 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:25:57,484 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:25:57,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-20 07:25:57,485 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:25:57,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:25:57,486 INFO L85 PathProgramCache]: Analyzing trace with hash -512444020, now seen corresponding path program 2 times [2021-11-20 07:25:57,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:25:57,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427096621] [2021-11-20 07:25:57,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:25:57,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:25:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:25:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:25:57,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:25:57,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427096621] [2021-11-20 07:25:57,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427096621] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:25:57,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:25:57,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:25:57,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478279106] [2021-11-20 07:25:57,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:25:57,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:25:57,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:25:57,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:25:57,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:25:57,709 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2021-11-20 07:25:57,710 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 133 transitions, 557 flow. Second operand has 7 states, 7 states have (on average 94.57142857142857) internal successors, (662), 7 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:57,711 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:25:57,711 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2021-11-20 07:25:57,711 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:25:58,108 INFO L129 PetriNetUnfolder]: 196/1240 cut-off events. [2021-11-20 07:25:58,109 INFO L130 PetriNetUnfolder]: For 1400/1420 co-relation queries the response was YES. [2021-11-20 07:25:58,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3128 conditions, 1240 events. 196/1240 cut-off events. For 1400/1420 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 12043 event pairs, 27 based on Foata normal form. 6/1175 useless extension candidates. Maximal degree in co-relation 3100. Up to 132 conditions per place. [2021-11-20 07:25:58,121 INFO L132 encePairwiseOnDemand]: 109/115 looper letters, 20 selfloop transitions, 1 changer transitions 22/149 dead transitions. [2021-11-20 07:25:58,121 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 149 transitions, 713 flow [2021-11-20 07:25:58,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:25:58,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-11-20 07:25:58,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 675 transitions. [2021-11-20 07:25:58,124 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8385093167701864 [2021-11-20 07:25:58,124 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 675 transitions. [2021-11-20 07:25:58,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 675 transitions. [2021-11-20 07:25:58,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:25:58,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 675 transitions. [2021-11-20 07:25:58,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.42857142857143) internal successors, (675), 7 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:58,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:58,130 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:58,130 INFO L186 Difference]: Start difference. First operand has 156 places, 133 transitions, 557 flow. Second operand 7 states and 675 transitions. [2021-11-20 07:25:58,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 149 transitions, 713 flow [2021-11-20 07:25:58,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 149 transitions, 698 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-11-20 07:25:58,161 INFO L242 Difference]: Finished difference. Result has 158 places, 126 transitions, 517 flow [2021-11-20 07:25:58,161 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=517, PETRI_PLACES=158, PETRI_TRANSITIONS=126} [2021-11-20 07:25:58,162 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 38 predicate places. [2021-11-20 07:25:58,162 INFO L470 AbstractCegarLoop]: Abstraction has has 158 places, 126 transitions, 517 flow [2021-11-20 07:25:58,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.57142857142857) internal successors, (662), 7 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:25:58,163 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:25:58,163 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:25:58,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-20 07:25:58,163 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:25:58,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:25:58,164 INFO L85 PathProgramCache]: Analyzing trace with hash 764731660, now seen corresponding path program 3 times [2021-11-20 07:25:58,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:25:58,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404525972] [2021-11-20 07:25:58,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:25:58,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:25:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 07:25:58,213 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 07:25:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 07:25:58,313 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 07:25:58,313 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-20 07:25:58,314 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-11-20 07:25:58,317 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-11-20 07:25:58,317 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-11-20 07:25:58,317 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-11-20 07:25:58,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-11-20 07:25:58,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-11-20 07:25:58,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-20 07:25:58,323 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:25:58,329 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-20 07:25:58,329 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 07:25:58,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:25:58 BasicIcfg [2021-11-20 07:25:58,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 07:25:58,510 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 07:25:58,510 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 07:25:58,511 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 07:25:58,511 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:25:49" (3/4) ... [2021-11-20 07:25:58,513 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-20 07:25:58,654 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e6b9f2-554d-4fde-a6cb-4e1e82d39400/bin/uautomizer-DQz5hQGWxF/witness.graphml [2021-11-20 07:25:58,654 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 07:25:58,655 INFO L158 Benchmark]: Toolchain (without parser) took 11465.16ms. Allocated memory was 96.5MB in the beginning and 257.9MB in the end (delta: 161.5MB). Free memory was 57.8MB in the beginning and 96.8MB in the end (delta: -39.0MB). Peak memory consumption was 122.9MB. Max. memory is 16.1GB. [2021-11-20 07:25:58,656 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 96.5MB. Free memory was 67.8MB in the beginning and 67.8MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 07:25:58,656 INFO L158 Benchmark]: CACSL2BoogieTranslator took 765.19ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 57.6MB in the beginning and 78.0MB in the end (delta: -20.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-20 07:25:58,657 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.99ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 74.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 07:25:58,657 INFO L158 Benchmark]: Boogie Preprocessor took 36.59ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 72.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 07:25:58,658 INFO L158 Benchmark]: RCFGBuilder took 1538.03ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 54.8MB in the end (delta: 17.8MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2021-11-20 07:25:58,658 INFO L158 Benchmark]: TraceAbstraction took 8897.49ms. Allocated memory was 117.4MB in the beginning and 257.9MB in the end (delta: 140.5MB). Free memory was 54.1MB in the beginning and 126.2MB in the end (delta: -72.1MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. [2021-11-20 07:25:58,659 INFO L158 Benchmark]: Witness Printer took 144.30ms. Allocated memory is still 257.9MB. Free memory was 125.1MB in the beginning and 96.8MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-11-20 07:25:58,661 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.29ms. Allocated memory is still 96.5MB. Free memory was 67.8MB in the beginning and 67.8MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 765.19ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 57.6MB in the beginning and 78.0MB in the end (delta: -20.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.99ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 74.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.59ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 72.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1538.03ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 54.8MB in the end (delta: 17.8MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8897.49ms. Allocated memory was 117.4MB in the beginning and 257.9MB in the end (delta: 140.5MB). Free memory was 54.1MB in the beginning and 126.2MB in the end (delta: -72.1MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. * Witness Printer took 144.30ms. Allocated memory is still 257.9MB. Free memory was 125.1MB in the beginning and 96.8MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L719] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] 0 pthread_t t1403; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1403={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L821] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1403, ((void *)0), P0, ((void *)0))=-2, t1403={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] 0 pthread_t t1404; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L823] FCALL, FORK 0 pthread_create(&t1404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1404, ((void *)0), P1, ((void *)0))=-1, t1403={5:0}, t1404={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L824] 0 pthread_t t1405; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] FCALL, FORK 0 pthread_create(&t1405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1405, ((void *)0), P2, ((void *)0))=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L792] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L831] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L843] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L843] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L844] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L844] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L845] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L847] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L847] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L848] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L850] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 825]: 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: 823]: 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: 821]: 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, 142 locations, 6 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: 8.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 466 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 466 mSDsluCounter, 300 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 653 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1073 IncrementalHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 60 mSDtfsCounter, 1073 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=658occurred in iteration=7, InterpolantAutomatonStates: 95, 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.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 787 NumberOfCodeBlocks, 787 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 689 ConstructedInterpolants, 0 QuantifiedInterpolants, 2956 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 proved your program to be incorrect! [2021-11-20 07:25:58,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e6b9f2-554d-4fde-a6cb-4e1e82d39400/bin/uautomizer-DQz5hQGWxF/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE