./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix043.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb55cbf-c6b6-48b1-8962-1056867d8d72/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb55cbf-c6b6-48b1-8962-1056867d8d72/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb55cbf-c6b6-48b1-8962-1056867d8d72/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb55cbf-c6b6-48b1-8962-1056867d8d72/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix043.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb55cbf-c6b6-48b1-8962-1056867d8d72/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb55cbf-c6b6-48b1-8962-1056867d8d72/bin/uautomizer-QkZJyEgLgS --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 9bfd96daa3950021158d7079dc25a62741fa5d5a7f9e521049c1a78760db50f1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 02:41:54,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:41:54,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:41:54,887 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:41:54,887 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:41:54,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:41:54,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:41:54,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:41:54,894 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:41:54,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:41:54,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:41:54,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:41:54,898 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:41:54,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:41:54,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:41:54,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:41:54,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:41:54,904 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:41:54,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:41:54,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:41:54,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:41:54,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:41:54,913 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:41:54,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:41:54,918 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:41:54,919 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:41:54,919 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:41:54,920 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:41:54,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:41:54,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:41:54,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:41:54,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:41:54,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:41:54,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:41:54,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:41:54,928 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:41:54,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:41:54,929 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:41:54,929 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:41:54,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:41:54,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:41:54,933 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb55cbf-c6b6-48b1-8962-1056867d8d72/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 02:41:54,958 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:41:54,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:41:54,959 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:41:54,960 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:41:54,961 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:41:54,961 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:41:54,962 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:41:54,962 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:41:54,963 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:41:54,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:41:54,963 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:41:54,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:41:54,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:41:54,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:41:54,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 02:41:54,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:41:54,965 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 02:41:54,965 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:41:54,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 02:41:54,966 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:41:54,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 02:41:54,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:41:54,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:41:54,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:41:54,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:41:54,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:41:54,969 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:41:54,969 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 02:41:54,969 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 02:41:54,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 02:41:54,970 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:41:54,970 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 02:41:54,971 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:41:54,971 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:41:54,971 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb55cbf-c6b6-48b1-8962-1056867d8d72/bin/uautomizer-QkZJyEgLgS/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_1eb55cbf-c6b6-48b1-8962-1056867d8d72/bin/uautomizer-QkZJyEgLgS 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 -> 9bfd96daa3950021158d7079dc25a62741fa5d5a7f9e521049c1a78760db50f1 [2022-11-23 02:41:55,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:41:55,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:41:55,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:41:55,262 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:41:55,262 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:41:55,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb55cbf-c6b6-48b1-8962-1056867d8d72/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/mix043.oepc.i [2022-11-23 02:41:58,617 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:41:59,004 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:41:59,006 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb55cbf-c6b6-48b1-8962-1056867d8d72/sv-benchmarks/c/pthread-wmm/mix043.oepc.i [2022-11-23 02:41:59,022 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb55cbf-c6b6-48b1-8962-1056867d8d72/bin/uautomizer-QkZJyEgLgS/data/abe3b3a01/17f7324060d345b7abed8aa851fcd3a0/FLAG779dfdcdb [2022-11-23 02:41:59,053 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb55cbf-c6b6-48b1-8962-1056867d8d72/bin/uautomizer-QkZJyEgLgS/data/abe3b3a01/17f7324060d345b7abed8aa851fcd3a0 [2022-11-23 02:41:59,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:41:59,060 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:41:59,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:41:59,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:41:59,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:41:59,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:41:59" (1/1) ... [2022-11-23 02:41:59,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cfacc23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59, skipping insertion in model container [2022-11-23 02:41:59,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:41:59" (1/1) ... [2022-11-23 02:41:59,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:41:59,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:41:59,334 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb55cbf-c6b6-48b1-8962-1056867d8d72/sv-benchmarks/c/pthread-wmm/mix043.oepc.i[945,958] [2022-11-23 02:41:59,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:41:59,599 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:41:59,619 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb55cbf-c6b6-48b1-8962-1056867d8d72/sv-benchmarks/c/pthread-wmm/mix043.oepc.i[945,958] [2022-11-23 02:41:59,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:41:59,784 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:41:59,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59 WrapperNode [2022-11-23 02:41:59,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:41:59,787 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:41:59,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:41:59,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:41:59,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59" (1/1) ... [2022-11-23 02:41:59,834 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59" (1/1) ... [2022-11-23 02:41:59,874 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-11-23 02:41:59,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:41:59,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:41:59,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:41:59,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:41:59,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59" (1/1) ... [2022-11-23 02:41:59,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59" (1/1) ... [2022-11-23 02:41:59,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59" (1/1) ... [2022-11-23 02:41:59,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59" (1/1) ... [2022-11-23 02:41:59,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59" (1/1) ... [2022-11-23 02:41:59,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59" (1/1) ... [2022-11-23 02:41:59,906 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59" (1/1) ... [2022-11-23 02:41:59,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59" (1/1) ... [2022-11-23 02:41:59,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:41:59,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:41:59,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:41:59,914 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:41:59,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59" (1/1) ... [2022-11-23 02:41:59,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:41:59,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb55cbf-c6b6-48b1-8962-1056867d8d72/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:41:59,951 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb55cbf-c6b6-48b1-8962-1056867d8d72/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 02:41:59,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb55cbf-c6b6-48b1-8962-1056867d8d72/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 02:42:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 02:42:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 02:42:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:42:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 02:42:00,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 02:42:00,015 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 02:42:00,017 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 02:42:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 02:42:00,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 02:42:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 02:42:00,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 02:42:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-23 02:42:00,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-23 02:42:00,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 02:42:00,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 02:42:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:42:00,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:42:00,022 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 02:42:00,192 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:42:00,194 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:42:00,803 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:42:01,049 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:42:01,049 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 02:42:01,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:42:01 BoogieIcfgContainer [2022-11-23 02:42:01,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:42:01,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 02:42:01,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 02:42:01,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 02:42:01,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:41:59" (1/3) ... [2022-11-23 02:42:01,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e142ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:42:01, skipping insertion in model container [2022-11-23 02:42:01,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59" (2/3) ... [2022-11-23 02:42:01,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e142ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:42:01, skipping insertion in model container [2022-11-23 02:42:01,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:42:01" (3/3) ... [2022-11-23 02:42:01,061 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.oepc.i [2022-11-23 02:42:01,071 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 02:42:01,084 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 02:42:01,084 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 02:42:01,084 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 02:42:01,156 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 02:42:01,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 300 flow [2022-11-23 02:42:01,305 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2022-11-23 02:42:01,306 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:42:01,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-11-23 02:42:01,313 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 140 transitions, 300 flow [2022-11-23 02:42:01,318 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 136 transitions, 284 flow [2022-11-23 02:42:01,323 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 02:42:01,338 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 136 transitions, 284 flow [2022-11-23 02:42:01,342 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 136 transitions, 284 flow [2022-11-23 02:42:01,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 284 flow [2022-11-23 02:42:01,377 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2022-11-23 02:42:01,378 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:42:01,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-11-23 02:42:01,381 INFO L119 LiptonReduction]: Number of co-enabled transitions 3518 [2022-11-23 02:42:07,737 INFO L134 LiptonReduction]: Checked pairs total: 9433 [2022-11-23 02:42:07,737 INFO L136 LiptonReduction]: Total number of compositions: 118 [2022-11-23 02:42:07,756 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:42:07,763 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@c727814, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:42:07,763 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-23 02:42:07,767 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-11-23 02:42:07,767 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:42:07,767 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:07,768 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 02:42:07,768 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:07,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:07,774 INFO L85 PathProgramCache]: Analyzing trace with hash 577052, now seen corresponding path program 1 times [2022-11-23 02:42:07,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:07,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50388311] [2022-11-23 02:42:07,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:07,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:08,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:08,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50388311] [2022-11-23 02:42:08,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50388311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:08,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:08,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:42:08,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078545828] [2022-11-23 02:42:08,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:08,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:42:08,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:08,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:42:08,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:42:08,265 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 258 [2022-11-23 02:42:08,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:08,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:08,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 258 [2022-11-23 02:42:08,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:10,013 INFO L130 PetriNetUnfolder]: 7063/9701 cut-off events. [2022-11-23 02:42:10,013 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-11-23 02:42:10,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19413 conditions, 9701 events. 7063/9701 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 49468 event pairs, 2679 based on Foata normal form. 0/9311 useless extension candidates. Maximal degree in co-relation 19401. Up to 7615 conditions per place. [2022-11-23 02:42:10,092 INFO L137 encePairwiseOnDemand]: 254/258 looper letters, 45 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2022-11-23 02:42:10,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 223 flow [2022-11-23 02:42:10,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:42:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:42:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2022-11-23 02:42:10,114 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5478036175710594 [2022-11-23 02:42:10,116 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2022-11-23 02:42:10,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2022-11-23 02:42:10,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:10,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2022-11-23 02:42:10,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:10,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:10,134 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:10,136 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 424 transitions. [2022-11-23 02:42:10,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 223 flow [2022-11-23 02:42:10,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 216 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-23 02:42:10,143 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2022-11-23 02:42:10,145 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2022-11-23 02:42:10,149 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2022-11-23 02:42:10,149 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2022-11-23 02:42:10,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:10,150 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:10,150 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:10,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 02:42:10,151 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:10,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:10,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1852707673, now seen corresponding path program 1 times [2022-11-23 02:42:10,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:10,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744123428] [2022-11-23 02:42:10,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:10,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:10,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:10,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:10,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744123428] [2022-11-23 02:42:10,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744123428] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:10,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:10,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:42:10,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834080981] [2022-11-23 02:42:10,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:10,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:42:10,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:10,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:42:10,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:42:10,651 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 258 [2022-11-23 02:42:10,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:10,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:10,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 258 [2022-11-23 02:42:10,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:15,088 INFO L130 PetriNetUnfolder]: 21113/28638 cut-off events. [2022-11-23 02:42:15,088 INFO L131 PetriNetUnfolder]: For 1463/1463 co-relation queries the response was YES. [2022-11-23 02:42:15,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59182 conditions, 28638 events. 21113/28638 cut-off events. For 1463/1463 co-relation queries the response was YES. Maximal size of possible extension queue 914. Compared 154366 event pairs, 7084 based on Foata normal form. 1188/29826 useless extension candidates. Maximal degree in co-relation 59172. Up to 16819 conditions per place. [2022-11-23 02:42:15,281 INFO L137 encePairwiseOnDemand]: 249/258 looper letters, 48 selfloop transitions, 7 changer transitions 35/90 dead transitions. [2022-11-23 02:42:15,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 90 transitions, 384 flow [2022-11-23 02:42:15,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:42:15,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:42:15,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 657 transitions. [2022-11-23 02:42:15,286 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5093023255813953 [2022-11-23 02:42:15,286 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 657 transitions. [2022-11-23 02:42:15,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 657 transitions. [2022-11-23 02:42:15,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:15,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 657 transitions. [2022-11-23 02:42:15,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:15,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:15,295 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:15,295 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 5 states and 657 transitions. [2022-11-23 02:42:15,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 90 transitions, 384 flow [2022-11-23 02:42:15,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 90 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:42:15,299 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 136 flow [2022-11-23 02:42:15,299 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2022-11-23 02:42:15,300 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2022-11-23 02:42:15,300 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 136 flow [2022-11-23 02:42:15,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:15,301 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:15,302 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:15,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 02:42:15,302 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:15,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:15,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1599323797, now seen corresponding path program 1 times [2022-11-23 02:42:15,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:15,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086921459] [2022-11-23 02:42:15,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:15,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:15,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:15,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:15,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086921459] [2022-11-23 02:42:15,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086921459] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:15,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:15,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:42:15,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658832281] [2022-11-23 02:42:15,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:15,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:42:15,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:15,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:42:15,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:42:15,563 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 258 [2022-11-23 02:42:15,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:15,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:15,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 258 [2022-11-23 02:42:15,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:18,975 INFO L130 PetriNetUnfolder]: 18527/25296 cut-off events. [2022-11-23 02:42:18,975 INFO L131 PetriNetUnfolder]: For 14415/14415 co-relation queries the response was YES. [2022-11-23 02:42:19,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65824 conditions, 25296 events. 18527/25296 cut-off events. For 14415/14415 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 133602 event pairs, 4132 based on Foata normal form. 1168/26464 useless extension candidates. Maximal degree in co-relation 65810. Up to 10951 conditions per place. [2022-11-23 02:42:19,151 INFO L137 encePairwiseOnDemand]: 250/258 looper letters, 57 selfloop transitions, 7 changer transitions 47/111 dead transitions. [2022-11-23 02:42:19,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 111 transitions, 600 flow [2022-11-23 02:42:19,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:42:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 02:42:19,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 896 transitions. [2022-11-23 02:42:19,156 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49612403100775193 [2022-11-23 02:42:19,156 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 896 transitions. [2022-11-23 02:42:19,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 896 transitions. [2022-11-23 02:42:19,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:19,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 896 transitions. [2022-11-23 02:42:19,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:19,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:19,168 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:19,168 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 136 flow. Second operand 7 states and 896 transitions. [2022-11-23 02:42:19,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 111 transitions, 600 flow [2022-11-23 02:42:19,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 111 transitions, 558 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-23 02:42:19,666 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 180 flow [2022-11-23 02:42:19,666 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=180, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2022-11-23 02:42:19,668 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2022-11-23 02:42:19,668 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 180 flow [2022-11-23 02:42:19,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:19,669 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:19,669 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:19,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 02:42:19,670 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:19,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:19,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1914122610, now seen corresponding path program 1 times [2022-11-23 02:42:19,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:19,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013067322] [2022-11-23 02:42:19,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:19,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:19,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:19,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013067322] [2022-11-23 02:42:19,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013067322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:19,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:19,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:42:19,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711379349] [2022-11-23 02:42:19,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:19,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:42:19,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:19,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:42:19,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:42:19,888 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 258 [2022-11-23 02:42:19,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:19,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:19,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 258 [2022-11-23 02:42:19,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:21,794 INFO L130 PetriNetUnfolder]: 9978/14574 cut-off events. [2022-11-23 02:42:21,794 INFO L131 PetriNetUnfolder]: For 12052/12263 co-relation queries the response was YES. [2022-11-23 02:42:21,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37741 conditions, 14574 events. 9978/14574 cut-off events. For 12052/12263 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 87166 event pairs, 1827 based on Foata normal form. 1072/15517 useless extension candidates. Maximal degree in co-relation 37721. Up to 6845 conditions per place. [2022-11-23 02:42:21,900 INFO L137 encePairwiseOnDemand]: 251/258 looper letters, 64 selfloop transitions, 6 changer transitions 0/79 dead transitions. [2022-11-23 02:42:21,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 79 transitions, 468 flow [2022-11-23 02:42:21,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:42:21,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 02:42:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 535 transitions. [2022-11-23 02:42:21,903 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5184108527131783 [2022-11-23 02:42:21,903 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 535 transitions. [2022-11-23 02:42:21,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 535 transitions. [2022-11-23 02:42:21,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:21,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 535 transitions. [2022-11-23 02:42:21,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:21,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:21,911 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:21,911 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 180 flow. Second operand 4 states and 535 transitions. [2022-11-23 02:42:21,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 79 transitions, 468 flow [2022-11-23 02:42:22,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 453 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-11-23 02:42:22,049 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 215 flow [2022-11-23 02:42:22,050 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-11-23 02:42:22,052 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2022-11-23 02:42:22,052 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 215 flow [2022-11-23 02:42:22,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:22,053 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:22,053 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:22,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 02:42:22,053 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:22,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:22,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1268988224, now seen corresponding path program 1 times [2022-11-23 02:42:22,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:22,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874336821] [2022-11-23 02:42:22,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:22,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:22,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:22,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:22,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874336821] [2022-11-23 02:42:22,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874336821] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:22,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:22,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:42:22,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416032316] [2022-11-23 02:42:22,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:22,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:42:22,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:22,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:42:22,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:42:22,490 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 258 [2022-11-23 02:42:22,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 215 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:22,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:22,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 258 [2022-11-23 02:42:22,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:24,372 INFO L130 PetriNetUnfolder]: 7394/11158 cut-off events. [2022-11-23 02:42:24,372 INFO L131 PetriNetUnfolder]: For 9067/9177 co-relation queries the response was YES. [2022-11-23 02:42:24,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33715 conditions, 11158 events. 7394/11158 cut-off events. For 9067/9177 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 67980 event pairs, 1662 based on Foata normal form. 642/11680 useless extension candidates. Maximal degree in co-relation 33694. Up to 4141 conditions per place. [2022-11-23 02:42:24,428 INFO L137 encePairwiseOnDemand]: 251/258 looper letters, 82 selfloop transitions, 10 changer transitions 0/101 dead transitions. [2022-11-23 02:42:24,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 101 transitions, 628 flow [2022-11-23 02:42:24,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:42:24,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:42:24,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2022-11-23 02:42:24,432 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5209302325581395 [2022-11-23 02:42:24,432 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2022-11-23 02:42:24,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2022-11-23 02:42:24,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:24,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2022-11-23 02:42:24,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:24,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:24,439 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:24,440 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 215 flow. Second operand 5 states and 672 transitions. [2022-11-23 02:42:24,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 101 transitions, 628 flow [2022-11-23 02:42:24,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 101 transitions, 619 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-23 02:42:24,463 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 274 flow [2022-11-23 02:42:24,464 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2022-11-23 02:42:24,464 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2022-11-23 02:42:24,465 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 274 flow [2022-11-23 02:42:24,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:24,466 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:24,466 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:24,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 02:42:24,466 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:24,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:24,467 INFO L85 PathProgramCache]: Analyzing trace with hash -2022116361, now seen corresponding path program 1 times [2022-11-23 02:42:24,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:24,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681560066] [2022-11-23 02:42:24,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:24,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:25,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:25,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681560066] [2022-11-23 02:42:25,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681560066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:25,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:25,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:42:25,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118265494] [2022-11-23 02:42:25,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:25,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:42:25,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:25,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:42:25,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:42:25,293 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 258 [2022-11-23 02:42:25,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:25,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:25,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 258 [2022-11-23 02:42:25,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:28,667 INFO L130 PetriNetUnfolder]: 12431/19164 cut-off events. [2022-11-23 02:42:28,667 INFO L131 PetriNetUnfolder]: For 35379/35519 co-relation queries the response was YES. [2022-11-23 02:42:28,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66160 conditions, 19164 events. 12431/19164 cut-off events. For 35379/35519 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 132104 event pairs, 3440 based on Foata normal form. 106/19177 useless extension candidates. Maximal degree in co-relation 66138. Up to 10568 conditions per place. [2022-11-23 02:42:28,795 INFO L137 encePairwiseOnDemand]: 249/258 looper letters, 98 selfloop transitions, 14 changer transitions 49/170 dead transitions. [2022-11-23 02:42:28,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 170 transitions, 1266 flow [2022-11-23 02:42:28,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 02:42:28,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-23 02:42:28,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1052 transitions. [2022-11-23 02:42:28,800 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5096899224806202 [2022-11-23 02:42:28,800 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1052 transitions. [2022-11-23 02:42:28,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1052 transitions. [2022-11-23 02:42:28,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:28,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1052 transitions. [2022-11-23 02:42:28,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.5) internal successors, (1052), 8 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:28,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:28,810 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:28,811 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 274 flow. Second operand 8 states and 1052 transitions. [2022-11-23 02:42:28,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 170 transitions, 1266 flow [2022-11-23 02:42:28,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 170 transitions, 1205 flow, removed 18 selfloop flow, removed 2 redundant places. [2022-11-23 02:42:28,866 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 384 flow [2022-11-23 02:42:28,866 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=384, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2022-11-23 02:42:28,867 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2022-11-23 02:42:28,867 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 384 flow [2022-11-23 02:42:28,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:28,868 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:28,868 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:28,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 02:42:28,868 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:28,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:28,869 INFO L85 PathProgramCache]: Analyzing trace with hash -844111017, now seen corresponding path program 2 times [2022-11-23 02:42:28,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:28,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546270383] [2022-11-23 02:42:28,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:28,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:29,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:29,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:29,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546270383] [2022-11-23 02:42:29,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546270383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:29,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:29,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:42:29,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332322951] [2022-11-23 02:42:29,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:29,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:42:29,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:29,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:42:29,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:42:29,264 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 258 [2022-11-23 02:42:29,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 384 flow. Second operand has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:29,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:29,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 258 [2022-11-23 02:42:29,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:31,787 INFO L130 PetriNetUnfolder]: 10349/15827 cut-off events. [2022-11-23 02:42:31,787 INFO L131 PetriNetUnfolder]: For 30977/31315 co-relation queries the response was YES. [2022-11-23 02:42:31,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60093 conditions, 15827 events. 10349/15827 cut-off events. For 30977/31315 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 107313 event pairs, 1721 based on Foata normal form. 355/15970 useless extension candidates. Maximal degree in co-relation 60066. Up to 6540 conditions per place. [2022-11-23 02:42:31,915 INFO L137 encePairwiseOnDemand]: 251/258 looper letters, 135 selfloop transitions, 14 changer transitions 10/168 dead transitions. [2022-11-23 02:42:31,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 168 transitions, 1294 flow [2022-11-23 02:42:31,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:42:31,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 02:42:31,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 807 transitions. [2022-11-23 02:42:31,921 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5213178294573644 [2022-11-23 02:42:31,921 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 807 transitions. [2022-11-23 02:42:31,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 807 transitions. [2022-11-23 02:42:31,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:31,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 807 transitions. [2022-11-23 02:42:31,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.5) internal successors, (807), 6 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:31,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 258.0) internal successors, (1806), 7 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:31,930 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 258.0) internal successors, (1806), 7 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:31,931 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 384 flow. Second operand 6 states and 807 transitions. [2022-11-23 02:42:31,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 168 transitions, 1294 flow [2022-11-23 02:42:32,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 168 transitions, 1281 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-11-23 02:42:32,060 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 453 flow [2022-11-23 02:42:32,061 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=453, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2022-11-23 02:42:32,061 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places. [2022-11-23 02:42:32,062 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 453 flow [2022-11-23 02:42:32,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:32,063 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:32,063 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:32,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 02:42:32,063 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:32,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:32,064 INFO L85 PathProgramCache]: Analyzing trace with hash 782650427, now seen corresponding path program 1 times [2022-11-23 02:42:32,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:32,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629416123] [2022-11-23 02:42:32,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:32,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:33,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:33,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629416123] [2022-11-23 02:42:33,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629416123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:33,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:33,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 02:42:33,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330447339] [2022-11-23 02:42:33,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:33,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 02:42:33,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:33,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 02:42:33,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:42:33,578 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 258 [2022-11-23 02:42:33,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 453 flow. Second operand has 8 states, 8 states have (on average 119.875) internal successors, (959), 8 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:33,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:33,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 258 [2022-11-23 02:42:33,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:36,190 INFO L130 PetriNetUnfolder]: 11465/17796 cut-off events. [2022-11-23 02:42:36,190 INFO L131 PetriNetUnfolder]: For 54298/54840 co-relation queries the response was YES. [2022-11-23 02:42:36,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73916 conditions, 17796 events. 11465/17796 cut-off events. For 54298/54840 co-relation queries the response was YES. Maximal size of possible extension queue 886. Compared 124820 event pairs, 2174 based on Foata normal form. 353/18066 useless extension candidates. Maximal degree in co-relation 73898. Up to 6903 conditions per place. [2022-11-23 02:42:36,312 INFO L137 encePairwiseOnDemand]: 250/258 looper letters, 115 selfloop transitions, 12 changer transitions 58/194 dead transitions. [2022-11-23 02:42:36,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 194 transitions, 1778 flow [2022-11-23 02:42:36,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 02:42:36,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-23 02:42:36,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1033 transitions. [2022-11-23 02:42:36,317 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.500484496124031 [2022-11-23 02:42:36,317 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1033 transitions. [2022-11-23 02:42:36,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1033 transitions. [2022-11-23 02:42:36,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:36,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1033 transitions. [2022-11-23 02:42:36,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 129.125) internal successors, (1033), 8 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:36,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:36,327 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:36,327 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 453 flow. Second operand 8 states and 1033 transitions. [2022-11-23 02:42:36,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 194 transitions, 1778 flow [2022-11-23 02:42:37,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 194 transitions, 1638 flow, removed 38 selfloop flow, removed 3 redundant places. [2022-11-23 02:42:37,735 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 517 flow [2022-11-23 02:42:37,735 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=517, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2022-11-23 02:42:37,736 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 31 predicate places. [2022-11-23 02:42:37,736 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 517 flow [2022-11-23 02:42:37,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 119.875) internal successors, (959), 8 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:37,737 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:37,738 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:37,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 02:42:37,738 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:37,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:37,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1925232735, now seen corresponding path program 1 times [2022-11-23 02:42:37,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:37,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455318644] [2022-11-23 02:42:37,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:37,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:38,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:38,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:38,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455318644] [2022-11-23 02:42:38,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455318644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:38,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:38,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 02:42:38,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302712789] [2022-11-23 02:42:38,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:38,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 02:42:38,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:38,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 02:42:38,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:42:38,726 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 258 [2022-11-23 02:42:38,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 517 flow. Second operand has 8 states, 8 states have (on average 119.875) internal successors, (959), 8 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:38,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:38,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 258 [2022-11-23 02:42:38,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:41,409 INFO L130 PetriNetUnfolder]: 12756/19984 cut-off events. [2022-11-23 02:42:41,409 INFO L131 PetriNetUnfolder]: For 59327/59966 co-relation queries the response was YES. [2022-11-23 02:42:41,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85420 conditions, 19984 events. 12756/19984 cut-off events. For 59327/59966 co-relation queries the response was YES. Maximal size of possible extension queue 1068. Compared 144768 event pairs, 3388 based on Foata normal form. 489/20379 useless extension candidates. Maximal degree in co-relation 85398. Up to 9962 conditions per place. [2022-11-23 02:42:41,562 INFO L137 encePairwiseOnDemand]: 249/258 looper letters, 110 selfloop transitions, 20 changer transitions 51/190 dead transitions. [2022-11-23 02:42:41,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 190 transitions, 1691 flow [2022-11-23 02:42:41,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 02:42:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-23 02:42:41,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1032 transitions. [2022-11-23 02:42:41,567 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-11-23 02:42:41,567 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1032 transitions. [2022-11-23 02:42:41,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1032 transitions. [2022-11-23 02:42:41,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:41,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1032 transitions. [2022-11-23 02:42:41,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:41,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:41,577 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:41,578 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 517 flow. Second operand 8 states and 1032 transitions. [2022-11-23 02:42:41,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 190 transitions, 1691 flow [2022-11-23 02:42:43,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 190 transitions, 1665 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-11-23 02:42:43,765 INFO L231 Difference]: Finished difference. Result has 79 places, 78 transitions, 666 flow [2022-11-23 02:42:43,765 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=666, PETRI_PLACES=79, PETRI_TRANSITIONS=78} [2022-11-23 02:42:43,766 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 35 predicate places. [2022-11-23 02:42:43,766 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 78 transitions, 666 flow [2022-11-23 02:42:43,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 119.875) internal successors, (959), 8 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:43,767 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:43,768 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:43,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 02:42:43,768 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:43,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:43,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1851016979, now seen corresponding path program 2 times [2022-11-23 02:42:43,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:43,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925132994] [2022-11-23 02:42:43,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:43,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:44,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:44,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925132994] [2022-11-23 02:42:44,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925132994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:44,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:44,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:42:44,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123895408] [2022-11-23 02:42:44,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:44,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:42:44,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:44,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:42:44,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:42:44,169 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 258 [2022-11-23 02:42:44,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 78 transitions, 666 flow. Second operand has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:44,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:44,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 258 [2022-11-23 02:42:44,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:48,201 INFO L130 PetriNetUnfolder]: 22253/33045 cut-off events. [2022-11-23 02:42:48,202 INFO L131 PetriNetUnfolder]: For 120327/120327 co-relation queries the response was YES. [2022-11-23 02:42:48,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152516 conditions, 33045 events. 22253/33045 cut-off events. For 120327/120327 co-relation queries the response was YES. Maximal size of possible extension queue 1396. Compared 226394 event pairs, 2452 based on Foata normal form. 19/33064 useless extension candidates. Maximal degree in co-relation 152493. Up to 14132 conditions per place. [2022-11-23 02:42:48,411 INFO L137 encePairwiseOnDemand]: 248/258 looper letters, 184 selfloop transitions, 22 changer transitions 98/304 dead transitions. [2022-11-23 02:42:48,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 304 transitions, 3171 flow [2022-11-23 02:42:48,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:42:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 02:42:48,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 907 transitions. [2022-11-23 02:42:48,415 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5022148394241418 [2022-11-23 02:42:48,415 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 907 transitions. [2022-11-23 02:42:48,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 907 transitions. [2022-11-23 02:42:48,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:48,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 907 transitions. [2022-11-23 02:42:48,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.57142857142858) internal successors, (907), 7 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:48,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:48,424 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:48,424 INFO L175 Difference]: Start difference. First operand has 79 places, 78 transitions, 666 flow. Second operand 7 states and 907 transitions. [2022-11-23 02:42:48,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 304 transitions, 3171 flow [2022-11-23 02:42:51,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 304 transitions, 3144 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-11-23 02:42:51,906 INFO L231 Difference]: Finished difference. Result has 82 places, 84 transitions, 777 flow [2022-11-23 02:42:51,907 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=777, PETRI_PLACES=82, PETRI_TRANSITIONS=84} [2022-11-23 02:42:51,908 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 38 predicate places. [2022-11-23 02:42:51,908 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 84 transitions, 777 flow [2022-11-23 02:42:51,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:51,909 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:51,909 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:51,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 02:42:51,909 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:51,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:51,910 INFO L85 PathProgramCache]: Analyzing trace with hash 714801189, now seen corresponding path program 3 times [2022-11-23 02:42:51,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:51,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238560573] [2022-11-23 02:42:51,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:51,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:52,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:52,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:52,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238560573] [2022-11-23 02:42:52,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238560573] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:52,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:52,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 02:42:52,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526406754] [2022-11-23 02:42:52,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:52,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 02:42:52,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:52,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 02:42:52,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 02:42:52,294 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 258 [2022-11-23 02:42:52,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 84 transitions, 777 flow. Second operand has 7 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:52,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:52,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 258 [2022-11-23 02:42:52,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:53,884 INFO L130 PetriNetUnfolder]: 5556/8890 cut-off events. [2022-11-23 02:42:53,884 INFO L131 PetriNetUnfolder]: For 39121/39470 co-relation queries the response was YES. [2022-11-23 02:42:53,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42084 conditions, 8890 events. 5556/8890 cut-off events. For 39121/39470 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 59508 event pairs, 804 based on Foata normal form. 141/8887 useless extension candidates. Maximal degree in co-relation 42060. Up to 3628 conditions per place. [2022-11-23 02:42:53,932 INFO L137 encePairwiseOnDemand]: 251/258 looper letters, 141 selfloop transitions, 18 changer transitions 19/189 dead transitions. [2022-11-23 02:42:53,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 189 transitions, 1945 flow [2022-11-23 02:42:53,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:42:53,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 02:42:53,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 909 transitions. [2022-11-23 02:42:53,936 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5033222591362126 [2022-11-23 02:42:53,936 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 909 transitions. [2022-11-23 02:42:53,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 909 transitions. [2022-11-23 02:42:53,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:53,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 909 transitions. [2022-11-23 02:42:53,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.85714285714286) internal successors, (909), 7 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:53,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:53,944 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:53,944 INFO L175 Difference]: Start difference. First operand has 82 places, 84 transitions, 777 flow. Second operand 7 states and 909 transitions. [2022-11-23 02:42:53,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 189 transitions, 1945 flow [2022-11-23 02:42:54,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 189 transitions, 1873 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-11-23 02:42:54,618 INFO L231 Difference]: Finished difference. Result has 82 places, 79 transitions, 676 flow [2022-11-23 02:42:54,618 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=676, PETRI_PLACES=82, PETRI_TRANSITIONS=79} [2022-11-23 02:42:54,619 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 38 predicate places. [2022-11-23 02:42:54,619 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 79 transitions, 676 flow [2022-11-23 02:42:54,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:54,620 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:54,620 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:54,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 02:42:54,620 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:54,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:54,621 INFO L85 PathProgramCache]: Analyzing trace with hash 141079299, now seen corresponding path program 1 times [2022-11-23 02:42:54,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:54,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912609594] [2022-11-23 02:42:54,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:54,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:54,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:54,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:54,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912609594] [2022-11-23 02:42:54,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912609594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:54,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:54,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:42:54,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379379390] [2022-11-23 02:42:54,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:54,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:42:54,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:54,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:42:54,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:42:54,905 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 258 [2022-11-23 02:42:54,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 79 transitions, 676 flow. Second operand has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:54,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:54,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 258 [2022-11-23 02:42:54,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:56,340 INFO L130 PetriNetUnfolder]: 5748/9317 cut-off events. [2022-11-23 02:42:56,340 INFO L131 PetriNetUnfolder]: For 40976/41043 co-relation queries the response was YES. [2022-11-23 02:42:56,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44294 conditions, 9317 events. 5748/9317 cut-off events. For 40976/41043 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 61280 event pairs, 1170 based on Foata normal form. 12/9300 useless extension candidates. Maximal degree in co-relation 44272. Up to 4516 conditions per place. [2022-11-23 02:42:56,410 INFO L137 encePairwiseOnDemand]: 254/258 looper letters, 70 selfloop transitions, 1 changer transitions 84/162 dead transitions. [2022-11-23 02:42:56,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 162 transitions, 1677 flow [2022-11-23 02:42:56,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:42:56,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:42:56,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 655 transitions. [2022-11-23 02:42:56,413 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5077519379844961 [2022-11-23 02:42:56,413 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 655 transitions. [2022-11-23 02:42:56,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 655 transitions. [2022-11-23 02:42:56,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:56,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 655 transitions. [2022-11-23 02:42:56,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:56,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:56,419 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:56,420 INFO L175 Difference]: Start difference. First operand has 82 places, 79 transitions, 676 flow. Second operand 5 states and 655 transitions. [2022-11-23 02:42:56,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 162 transitions, 1677 flow [2022-11-23 02:42:56,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 162 transitions, 1532 flow, removed 43 selfloop flow, removed 6 redundant places. [2022-11-23 02:42:56,737 INFO L231 Difference]: Finished difference. Result has 82 places, 64 transitions, 474 flow [2022-11-23 02:42:56,737 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=474, PETRI_PLACES=82, PETRI_TRANSITIONS=64} [2022-11-23 02:42:56,738 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 38 predicate places. [2022-11-23 02:42:56,738 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 64 transitions, 474 flow [2022-11-23 02:42:56,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:56,739 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:56,739 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:56,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 02:42:56,739 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:56,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:56,740 INFO L85 PathProgramCache]: Analyzing trace with hash -299724285, now seen corresponding path program 2 times [2022-11-23 02:42:56,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:56,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175049090] [2022-11-23 02:42:56,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:56,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:57,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:57,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175049090] [2022-11-23 02:42:57,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175049090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:57,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:57,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:42:57,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028155189] [2022-11-23 02:42:57,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:57,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:42:57,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:57,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:42:57,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:42:57,109 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 258 [2022-11-23 02:42:57,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 64 transitions, 474 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:57,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:57,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 258 [2022-11-23 02:42:57,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:57,901 INFO L130 PetriNetUnfolder]: 2731/4534 cut-off events. [2022-11-23 02:42:57,901 INFO L131 PetriNetUnfolder]: For 15540/15540 co-relation queries the response was YES. [2022-11-23 02:42:57,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20394 conditions, 4534 events. 2731/4534 cut-off events. For 15540/15540 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 26882 event pairs, 785 based on Foata normal form. 1/4535 useless extension candidates. Maximal degree in co-relation 20371. Up to 2395 conditions per place. [2022-11-23 02:42:57,920 INFO L137 encePairwiseOnDemand]: 252/258 looper letters, 78 selfloop transitions, 4 changer transitions 34/116 dead transitions. [2022-11-23 02:42:57,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 116 transitions, 1055 flow [2022-11-23 02:42:57,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:42:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:42:57,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 625 transitions. [2022-11-23 02:42:57,924 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4844961240310077 [2022-11-23 02:42:57,924 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 625 transitions. [2022-11-23 02:42:57,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 625 transitions. [2022-11-23 02:42:57,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:57,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 625 transitions. [2022-11-23 02:42:57,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:57,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:57,931 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:57,932 INFO L175 Difference]: Start difference. First operand has 82 places, 64 transitions, 474 flow. Second operand 5 states and 625 transitions. [2022-11-23 02:42:57,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 116 transitions, 1055 flow [2022-11-23 02:42:58,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 116 transitions, 921 flow, removed 19 selfloop flow, removed 11 redundant places. [2022-11-23 02:42:58,005 INFO L231 Difference]: Finished difference. Result has 75 places, 53 transitions, 310 flow [2022-11-23 02:42:58,005 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=75, PETRI_TRANSITIONS=53} [2022-11-23 02:42:58,006 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 31 predicate places. [2022-11-23 02:42:58,006 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 53 transitions, 310 flow [2022-11-23 02:42:58,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:58,007 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:58,008 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:58,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 02:42:58,008 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:58,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:58,009 INFO L85 PathProgramCache]: Analyzing trace with hash 579275745, now seen corresponding path program 3 times [2022-11-23 02:42:58,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:58,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118325746] [2022-11-23 02:42:58,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:58,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:59,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:59,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:59,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118325746] [2022-11-23 02:42:59,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118325746] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:59,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:59,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 02:42:59,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935116607] [2022-11-23 02:42:59,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:59,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 02:42:59,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:59,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 02:42:59,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-23 02:42:59,632 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 258 [2022-11-23 02:42:59,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 53 transitions, 310 flow. Second operand has 9 states, 9 states have (on average 118.88888888888889) internal successors, (1070), 9 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:59,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:59,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 258 [2022-11-23 02:42:59,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:43:00,158 INFO L130 PetriNetUnfolder]: 650/1076 cut-off events. [2022-11-23 02:43:00,159 INFO L131 PetriNetUnfolder]: For 2425/2468 co-relation queries the response was YES. [2022-11-23 02:43:00,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4119 conditions, 1076 events. 650/1076 cut-off events. For 2425/2468 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4474 event pairs, 99 based on Foata normal form. 32/1104 useless extension candidates. Maximal degree in co-relation 4101. Up to 717 conditions per place. [2022-11-23 02:43:00,164 INFO L137 encePairwiseOnDemand]: 251/258 looper letters, 57 selfloop transitions, 5 changer transitions 37/102 dead transitions. [2022-11-23 02:43:00,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 102 transitions, 711 flow [2022-11-23 02:43:00,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 02:43:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-23 02:43:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 987 transitions. [2022-11-23 02:43:00,167 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47819767441860467 [2022-11-23 02:43:00,168 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 987 transitions. [2022-11-23 02:43:00,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 987 transitions. [2022-11-23 02:43:00,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:43:00,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 987 transitions. [2022-11-23 02:43:00,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 123.375) internal successors, (987), 8 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:43:00,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:43:00,175 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:43:00,176 INFO L175 Difference]: Start difference. First operand has 75 places, 53 transitions, 310 flow. Second operand 8 states and 987 transitions. [2022-11-23 02:43:00,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 102 transitions, 711 flow [2022-11-23 02:43:00,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 102 transitions, 650 flow, removed 15 selfloop flow, removed 11 redundant places. [2022-11-23 02:43:00,182 INFO L231 Difference]: Finished difference. Result has 72 places, 48 transitions, 243 flow [2022-11-23 02:43:00,182 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=243, PETRI_PLACES=72, PETRI_TRANSITIONS=48} [2022-11-23 02:43:00,183 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 28 predicate places. [2022-11-23 02:43:00,183 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 48 transitions, 243 flow [2022-11-23 02:43:00,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.88888888888889) internal successors, (1070), 9 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:43:00,184 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:43:00,184 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:43:00,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 02:43:00,185 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:43:00,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:43:00,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1805321543, now seen corresponding path program 4 times [2022-11-23 02:43:00,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:43:00,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781366594] [2022-11-23 02:43:00,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:43:00,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:43:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:43:00,491 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:43:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:43:00,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:43:00,650 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 02:43:00,651 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-23 02:43:00,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-23 02:43:00,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-23 02:43:00,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-23 02:43:00,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-23 02:43:00,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-23 02:43:00,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-23 02:43:00,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 02:43:00,655 INFO L444 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1] [2022-11-23 02:43:00,664 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 02:43:00,664 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 02:43:00,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:43:00 BasicIcfg [2022-11-23 02:43:00,815 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 02:43:00,816 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 02:43:00,819 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 02:43:00,819 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 02:43:00,820 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:42:01" (3/4) ... [2022-11-23 02:43:00,822 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 02:43:00,963 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb55cbf-c6b6-48b1-8962-1056867d8d72/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 02:43:00,963 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 02:43:00,964 INFO L158 Benchmark]: Toolchain (without parser) took 61903.66ms. Allocated memory was 153.1MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 107.2MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 485.6MB. Max. memory is 16.1GB. [2022-11-23 02:43:00,964 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 153.1MB. Free memory is still 96.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:43:00,965 INFO L158 Benchmark]: CACSL2BoogieTranslator took 720.49ms. Allocated memory is still 153.1MB. Free memory was 107.2MB in the beginning and 82.8MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-23 02:43:00,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.26ms. Allocated memory is still 153.1MB. Free memory was 82.8MB in the beginning and 80.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:43:00,969 INFO L158 Benchmark]: Boogie Preprocessor took 36.99ms. Allocated memory is still 153.1MB. Free memory was 80.7MB in the beginning and 78.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:43:00,969 INFO L158 Benchmark]: RCFGBuilder took 1138.38ms. Allocated memory was 153.1MB in the beginning and 197.1MB in the end (delta: 44.0MB). Free memory was 78.6MB in the beginning and 141.2MB in the end (delta: -62.6MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2022-11-23 02:43:00,970 INFO L158 Benchmark]: TraceAbstraction took 59761.72ms. Allocated memory was 197.1MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 141.2MB in the beginning and 4.3GB in the end (delta: -4.1GB). Peak memory consumption was 455.4MB. Max. memory is 16.1GB. [2022-11-23 02:43:00,970 INFO L158 Benchmark]: Witness Printer took 146.83ms. Allocated memory is still 4.8GB. Free memory was 4.3GB in the beginning and 4.3GB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-23 02:43:00,973 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.33ms. Allocated memory is still 153.1MB. Free memory is still 96.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 720.49ms. Allocated memory is still 153.1MB. Free memory was 107.2MB in the beginning and 82.8MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.26ms. Allocated memory is still 153.1MB. Free memory was 82.8MB in the beginning and 80.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.99ms. Allocated memory is still 153.1MB. Free memory was 80.7MB in the beginning and 78.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1138.38ms. Allocated memory was 153.1MB in the beginning and 197.1MB in the end (delta: 44.0MB). Free memory was 78.6MB in the beginning and 141.2MB in the end (delta: -62.6MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * TraceAbstraction took 59761.72ms. Allocated memory was 197.1MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 141.2MB in the beginning and 4.3GB in the end (delta: -4.1GB). Peak memory consumption was 455.4MB. Max. memory is 16.1GB. * Witness Printer took 146.83ms. Allocated memory is still 4.8GB. Free memory was 4.3GB in the beginning and 4.3GB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.4s, 147 PlacesBefore, 44 PlacesAfterwards, 136 TransitionsBefore, 32 TransitionsAfterwards, 3518 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 118 TotalNumberOfCompositions, 9433 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4753, independent: 4525, independent conditional: 0, independent unconditional: 4525, dependent: 228, dependent conditional: 0, dependent unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2471, independent: 2391, independent conditional: 0, independent unconditional: 2391, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2471, independent: 2359, independent conditional: 0, independent unconditional: 2359, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 112, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 848, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 799, dependent conditional: 0, dependent unconditional: 799, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4753, independent: 2134, independent conditional: 0, independent unconditional: 2134, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 2471, unknown conditional: 0, unknown unconditional: 2471] , Statistics on independence cache: Total cache size (in pairs): 303, Positive cache size: 272, Positive conditional cache size: 0, Positive unconditional cache size: 272, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1129; [L872] FCALL, FORK 0 pthread_create(&t1129, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1129, ((void *)0), P0, ((void *)0))=-2, t1129={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1130; [L874] FCALL, FORK 0 pthread_create(&t1130, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1130, ((void *)0), P1, ((void *)0))=-1, t1129={5:0}, t1130={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1131; [L876] FCALL, FORK 0 pthread_create(&t1131, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1131, ((void *)0), P2, ((void *)0))=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t1132; [L878] FCALL, FORK 0 pthread_create(&t1132, ((void *)0), P3, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1132, ((void *)0), P3, ((void *)0))=1, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L804] 3 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L807] 3 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L824] 4 z = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L891] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] - 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: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 178 locations, 7 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: 59.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 44.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1380 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1220 mSDsluCounter, 609 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 514 mSDsCounter, 156 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3067 IncrementalHoareTripleChecker+Invalid, 3223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 156 mSolverCounterUnsat, 95 mSDtfsCounter, 3067 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=777occurred in iteration=10, InterpolantAutomatonStates: 86, 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.8s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 274 ConstructedInterpolants, 0 QuantifiedInterpolants, 2314 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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! [2022-11-23 02:43:01,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb55cbf-c6b6-48b1-8962-1056867d8d72/bin/uautomizer-QkZJyEgLgS/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