./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_ac91cd17-53a1-4e6b-9c6c-faeacb748f8c/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac91cd17-53a1-4e6b-9c6c-faeacb748f8c/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac91cd17-53a1-4e6b-9c6c-faeacb748f8c/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac91cd17-53a1-4e6b-9c6c-faeacb748f8c/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac91cd17-53a1-4e6b-9c6c-faeacb748f8c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac91cd17-53a1-4e6b-9c6c-faeacb748f8c/bin/uautomizer-Dbtcem3rbc --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 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 --- 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-5e519f3 [2022-11-02 20:57:46,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:57:46,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:57:46,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:57:46,939 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:57:46,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:57:46,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:57:46,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:57:46,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:57:46,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:57:46,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:57:46,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:57:46,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:57:46,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:57:46,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:57:46,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:57:46,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:57:46,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:57:46,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:57:46,978 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:57:46,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:57:46,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:57:46,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:57:46,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:57:46,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:57:46,992 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:57:46,993 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:57:46,994 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:57:46,994 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:57:46,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:57:46,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:57:46,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:57:46,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:57:47,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:57:47,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:57:47,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:57:47,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:57:47,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:57:47,002 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:57:47,003 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:57:47,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:57:47,005 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac91cd17-53a1-4e6b-9c6c-faeacb748f8c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:57:47,046 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:57:47,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:57:47,047 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:57:47,047 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:57:47,048 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:57:47,048 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:57:47,049 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:57:47,049 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:57:47,049 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:57:47,050 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:57:47,051 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:57:47,051 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:57:47,051 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:57:47,051 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:57:47,051 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:57:47,051 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:57:47,052 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:57:47,052 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:57:47,052 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:57:47,052 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:57:47,052 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:57:47,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:57:47,053 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:57:47,053 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:57:47,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:57:47,053 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:57:47,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:57:47,055 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:57:47,055 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:57:47,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:57:47,056 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:57:47,056 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:57:47,057 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:57:47,057 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac91cd17-53a1-4e6b-9c6c-faeacb748f8c/bin/uautomizer-Dbtcem3rbc/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_ac91cd17-53a1-4e6b-9c6c-faeacb748f8c/bin/uautomizer-Dbtcem3rbc 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 -> 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 [2022-11-02 20:57:47,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:57:47,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:57:47,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:57:47,362 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:57:47,362 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:57:47,364 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac91cd17-53a1-4e6b-9c6c-faeacb748f8c/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-11-02 20:57:47,450 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac91cd17-53a1-4e6b-9c6c-faeacb748f8c/bin/uautomizer-Dbtcem3rbc/data/8cb414a98/cc2434cdd7ae47b7a4447e0bffc1fb7a/FLAG04eea8281 [2022-11-02 20:57:48,066 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:57:48,067 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac91cd17-53a1-4e6b-9c6c-faeacb748f8c/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-11-02 20:57:48,089 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac91cd17-53a1-4e6b-9c6c-faeacb748f8c/bin/uautomizer-Dbtcem3rbc/data/8cb414a98/cc2434cdd7ae47b7a4447e0bffc1fb7a/FLAG04eea8281 [2022-11-02 20:57:48,346 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac91cd17-53a1-4e6b-9c6c-faeacb748f8c/bin/uautomizer-Dbtcem3rbc/data/8cb414a98/cc2434cdd7ae47b7a4447e0bffc1fb7a [2022-11-02 20:57:48,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:57:48,357 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:57:48,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:57:48,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:57:48,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:57:48,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:57:48" (1/1) ... [2022-11-02 20:57:48,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bcab221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:48, skipping insertion in model container [2022-11-02 20:57:48,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:57:48" (1/1) ... [2022-11-02 20:57:48,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:57:48,447 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:57:48,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac91cd17-53a1-4e6b-9c6c-faeacb748f8c/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2022-11-02 20:57:48,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:57:48,925 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:57:48,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac91cd17-53a1-4e6b-9c6c-faeacb748f8c/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2022-11-02 20:57:49,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:57:49,050 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:57:49,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:49 WrapperNode [2022-11-02 20:57:49,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:57:49,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:57:49,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:57:49,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:57:49,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:49" (1/1) ... [2022-11-02 20:57:49,094 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:49" (1/1) ... [2022-11-02 20:57:49,135 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 273 [2022-11-02 20:57:49,143 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:57:49,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:57:49,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:57:49,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:57:49,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:49" (1/1) ... [2022-11-02 20:57:49,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:49" (1/1) ... [2022-11-02 20:57:49,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:49" (1/1) ... [2022-11-02 20:57:49,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:49" (1/1) ... [2022-11-02 20:57:49,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:49" (1/1) ... [2022-11-02 20:57:49,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:49" (1/1) ... [2022-11-02 20:57:49,192 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:49" (1/1) ... [2022-11-02 20:57:49,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:49" (1/1) ... [2022-11-02 20:57:49,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:57:49,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:57:49,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:57:49,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:57:49,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:49" (1/1) ... [2022-11-02 20:57:49,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:57:49,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac91cd17-53a1-4e6b-9c6c-faeacb748f8c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:49,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac91cd17-53a1-4e6b-9c6c-faeacb748f8c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:57:49,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac91cd17-53a1-4e6b-9c6c-faeacb748f8c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:57:49,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:57:49,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:57:49,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:57:49,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:57:49,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:57:49,312 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-02 20:57:49,312 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-02 20:57:49,313 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-02 20:57:49,314 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-02 20:57:49,314 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-02 20:57:49,314 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-02 20:57:49,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:57:49,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:57:49,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:57:49,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:57:49,318 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:57:49,484 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:57:49,487 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:57:50,132 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:57:50,606 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:57:50,606 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:57:50,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:50 BoogieIcfgContainer [2022-11-02 20:57:50,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:57:50,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:57:50,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:57:50,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:57:50,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:57:48" (1/3) ... [2022-11-02 20:57:50,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e61b95b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:57:50, skipping insertion in model container [2022-11-02 20:57:50,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:49" (2/3) ... [2022-11-02 20:57:50,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e61b95b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:57:50, skipping insertion in model container [2022-11-02 20:57:50,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:50" (3/3) ... [2022-11-02 20:57:50,620 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2022-11-02 20:57:50,628 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:57:50,639 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:57:50,639 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:57:50,639 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:57:50,704 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:57:50,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-11-02 20:57:50,831 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-11-02 20:57:50,831 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:57:50,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-11-02 20:57:50,836 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-11-02 20:57:50,841 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-11-02 20:57:50,864 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:57:50,872 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;@3eb0f685, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:57:50,873 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-02 20:57:50,902 INFO L130 PetriNetUnfolder]: 0/71 cut-off events. [2022-11-02 20:57:50,903 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:57:50,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:50,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:50,905 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:57:50,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:50,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2040665683, now seen corresponding path program 1 times [2022-11-02 20:57:50,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:50,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782148389] [2022-11-02 20:57:50,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:50,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:51,572 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-02 20:57:51,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:51,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782148389] [2022-11-02 20:57:51,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782148389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:51,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:51,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:51,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434922893] [2022-11-02 20:57:51,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:51,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:51,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:51,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:51,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:51,621 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 112 [2022-11-02 20:57:51,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 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-02 20:57:51,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:51,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 112 [2022-11-02 20:57:51,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:51,830 INFO L130 PetriNetUnfolder]: 17/241 cut-off events. [2022-11-02 20:57:51,830 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:57:51,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 241 events. 17/241 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 751 event pairs, 7 based on Foata normal form. 8/237 useless extension candidates. Maximal degree in co-relation 243. Up to 27 conditions per place. [2022-11-02 20:57:51,837 INFO L137 encePairwiseOnDemand]: 107/112 looper letters, 10 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2022-11-02 20:57:51,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 108 transitions, 249 flow [2022-11-02 20:57:51,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:51,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:51,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2022-11-02 20:57:51,857 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9345238095238095 [2022-11-02 20:57:51,858 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2022-11-02 20:57:51,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2022-11-02 20:57:51,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:51,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2022-11-02 20:57:51,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 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-02 20:57:51,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 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-02 20:57:51,881 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 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-02 20:57:51,883 INFO L175 Difference]: Start difference. First operand has 117 places, 109 transitions, 227 flow. Second operand 3 states and 314 transitions. [2022-11-02 20:57:51,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 108 transitions, 249 flow [2022-11-02 20:57:51,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 108 transitions, 246 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-02 20:57:51,892 INFO L231 Difference]: Finished difference. Result has 114 places, 105 transitions, 220 flow [2022-11-02 20:57:51,895 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=114, PETRI_TRANSITIONS=105} [2022-11-02 20:57:51,900 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, -3 predicate places. [2022-11-02 20:57:51,902 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 220 flow [2022-11-02 20:57:51,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 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-02 20:57:51,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:51,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:51,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:57:51,904 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:57:51,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:51,904 INFO L85 PathProgramCache]: Analyzing trace with hash -690634123, now seen corresponding path program 1 times [2022-11-02 20:57:51,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:51,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247691277] [2022-11-02 20:57:51,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:51,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:52,462 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-02 20:57:52,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:52,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247691277] [2022-11-02 20:57:52,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247691277] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:52,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:52,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:57:52,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543561370] [2022-11-02 20:57:52,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:52,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:57:52,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:52,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:57:52,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:57:52,467 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2022-11-02 20:57:52,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 105 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:52,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:52,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2022-11-02 20:57:52,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:52,989 INFO L130 PetriNetUnfolder]: 357/1164 cut-off events. [2022-11-02 20:57:52,989 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-11-02 20:57:52,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1841 conditions, 1164 events. 357/1164 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7954 event pairs, 56 based on Foata normal form. 0/1130 useless extension candidates. Maximal degree in co-relation 1791. Up to 333 conditions per place. [2022-11-02 20:57:53,000 INFO L137 encePairwiseOnDemand]: 105/112 looper letters, 20 selfloop transitions, 3 changer transitions 48/148 dead transitions. [2022-11-02 20:57:53,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 148 transitions, 444 flow [2022-11-02 20:57:53,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:57:53,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:57:53,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 881 transitions. [2022-11-02 20:57:53,006 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8740079365079365 [2022-11-02 20:57:53,006 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 881 transitions. [2022-11-02 20:57:53,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 881 transitions. [2022-11-02 20:57:53,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:53,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 881 transitions. [2022-11-02 20:57:53,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.88888888888889) internal successors, (881), 9 states have internal predecessors, (881), 0 states have call successors, (0), 0 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-02 20:57:53,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 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-02 20:57:53,015 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 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-02 20:57:53,015 INFO L175 Difference]: Start difference. First operand has 114 places, 105 transitions, 220 flow. Second operand 9 states and 881 transitions. [2022-11-02 20:57:53,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 148 transitions, 444 flow [2022-11-02 20:57:53,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 148 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:57:53,022 INFO L231 Difference]: Finished difference. Result has 127 places, 95 transitions, 235 flow [2022-11-02 20:57:53,022 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=235, PETRI_PLACES=127, PETRI_TRANSITIONS=95} [2022-11-02 20:57:53,023 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 10 predicate places. [2022-11-02 20:57:53,024 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 95 transitions, 235 flow [2022-11-02 20:57:53,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:53,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:53,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:53,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:57:53,025 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:57:53,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:53,026 INFO L85 PathProgramCache]: Analyzing trace with hash -909743756, now seen corresponding path program 1 times [2022-11-02 20:57:53,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:53,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422802021] [2022-11-02 20:57:53,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:53,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:53,395 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-02 20:57:53,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:53,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422802021] [2022-11-02 20:57:53,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422802021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:53,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:53,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:57:53,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725301046] [2022-11-02 20:57:53,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:53,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:57:53,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:53,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:57:53,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:57:53,399 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2022-11-02 20:57:53,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 95 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:53,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:53,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2022-11-02 20:57:53,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:53,880 INFO L130 PetriNetUnfolder]: 387/953 cut-off events. [2022-11-02 20:57:53,881 INFO L131 PetriNetUnfolder]: For 735/739 co-relation queries the response was YES. [2022-11-02 20:57:53,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2117 conditions, 953 events. 387/953 cut-off events. For 735/739 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5573 event pairs, 178 based on Foata normal form. 24/927 useless extension candidates. Maximal degree in co-relation 2060. Up to 348 conditions per place. [2022-11-02 20:57:53,892 INFO L137 encePairwiseOnDemand]: 105/112 looper letters, 20 selfloop transitions, 3 changer transitions 34/136 dead transitions. [2022-11-02 20:57:53,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 136 transitions, 453 flow [2022-11-02 20:57:53,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:57:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:57:53,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 878 transitions. [2022-11-02 20:57:53,898 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.871031746031746 [2022-11-02 20:57:53,898 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 878 transitions. [2022-11-02 20:57:53,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 878 transitions. [2022-11-02 20:57:53,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:53,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 878 transitions. [2022-11-02 20:57:53,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.55555555555556) internal successors, (878), 9 states have internal predecessors, (878), 0 states have call successors, (0), 0 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-02 20:57:53,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 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-02 20:57:53,905 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 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-02 20:57:53,905 INFO L175 Difference]: Start difference. First operand has 127 places, 95 transitions, 235 flow. Second operand 9 states and 878 transitions. [2022-11-02 20:57:53,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 136 transitions, 453 flow [2022-11-02 20:57:53,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 136 transitions, 436 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-11-02 20:57:53,916 INFO L231 Difference]: Finished difference. Result has 120 places, 97 transitions, 269 flow [2022-11-02 20:57:53,917 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=269, PETRI_PLACES=120, PETRI_TRANSITIONS=97} [2022-11-02 20:57:53,919 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 3 predicate places. [2022-11-02 20:57:53,919 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 97 transitions, 269 flow [2022-11-02 20:57:53,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:53,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:53,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:53,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:57:53,921 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:57:53,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:53,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2085786923, now seen corresponding path program 1 times [2022-11-02 20:57:53,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:53,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761886531] [2022-11-02 20:57:53,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:53,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:54,780 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-02 20:57:54,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:54,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761886531] [2022-11-02 20:57:54,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761886531] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:54,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:54,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:57:54,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695925334] [2022-11-02 20:57:54,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:54,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:57:54,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:54,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:57:54,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:57:54,789 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 112 [2022-11-02 20:57:54,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 97 transitions, 269 flow. Second operand has 9 states, 9 states have (on average 91.44444444444444) internal successors, (823), 9 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:54,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:54,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 112 [2022-11-02 20:57:54,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:55,347 INFO L130 PetriNetUnfolder]: 437/1046 cut-off events. [2022-11-02 20:57:55,347 INFO L131 PetriNetUnfolder]: For 1823/1832 co-relation queries the response was YES. [2022-11-02 20:57:55,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2820 conditions, 1046 events. 437/1046 cut-off events. For 1823/1832 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6253 event pairs, 163 based on Foata normal form. 29/1018 useless extension candidates. Maximal degree in co-relation 2756. Up to 401 conditions per place. [2022-11-02 20:57:55,359 INFO L137 encePairwiseOnDemand]: 101/112 looper letters, 16 selfloop transitions, 9 changer transitions 34/139 dead transitions. [2022-11-02 20:57:55,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 139 transitions, 517 flow [2022-11-02 20:57:55,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:57:55,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-02 20:57:55,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1322 transitions. [2022-11-02 20:57:55,363 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8431122448979592 [2022-11-02 20:57:55,363 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1322 transitions. [2022-11-02 20:57:55,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1322 transitions. [2022-11-02 20:57:55,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:55,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1322 transitions. [2022-11-02 20:57:55,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 94.42857142857143) internal successors, (1322), 14 states have internal predecessors, (1322), 0 states have call successors, (0), 0 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-02 20:57:55,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 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-02 20:57:55,372 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 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-02 20:57:55,372 INFO L175 Difference]: Start difference. First operand has 120 places, 97 transitions, 269 flow. Second operand 14 states and 1322 transitions. [2022-11-02 20:57:55,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 139 transitions, 517 flow [2022-11-02 20:57:55,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 139 transitions, 496 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-11-02 20:57:55,379 INFO L231 Difference]: Finished difference. Result has 134 places, 103 transitions, 346 flow [2022-11-02 20:57:55,379 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=346, PETRI_PLACES=134, PETRI_TRANSITIONS=103} [2022-11-02 20:57:55,380 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 17 predicate places. [2022-11-02 20:57:55,380 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 103 transitions, 346 flow [2022-11-02 20:57:55,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.44444444444444) internal successors, (823), 9 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:55,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:55,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:55,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:57:55,382 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:57:55,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:55,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1195724569, now seen corresponding path program 1 times [2022-11-02 20:57:55,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:55,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189981629] [2022-11-02 20:57:55,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:55,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:55,687 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-02 20:57:55,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:55,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189981629] [2022-11-02 20:57:55,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189981629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:55,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:55,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:57:55,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528862462] [2022-11-02 20:57:55,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:55,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:57:55,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:55,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:57:55,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:57:55,690 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2022-11-02 20:57:55,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 103 transitions, 346 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 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-02 20:57:55,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:55,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2022-11-02 20:57:55,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:56,233 INFO L130 PetriNetUnfolder]: 457/1170 cut-off events. [2022-11-02 20:57:56,234 INFO L131 PetriNetUnfolder]: For 4992/5182 co-relation queries the response was YES. [2022-11-02 20:57:56,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4444 conditions, 1170 events. 457/1170 cut-off events. For 4992/5182 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7310 event pairs, 192 based on Foata normal form. 20/1137 useless extension candidates. Maximal degree in co-relation 4370. Up to 366 conditions per place. [2022-11-02 20:57:56,249 INFO L137 encePairwiseOnDemand]: 106/112 looper letters, 32 selfloop transitions, 3 changer transitions 26/142 dead transitions. [2022-11-02 20:57:56,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 142 transitions, 759 flow [2022-11-02 20:57:56,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:57:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:57:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 873 transitions. [2022-11-02 20:57:56,252 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8660714285714286 [2022-11-02 20:57:56,252 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 873 transitions. [2022-11-02 20:57:56,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 873 transitions. [2022-11-02 20:57:56,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:56,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 873 transitions. [2022-11-02 20:57:56,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.0) internal successors, (873), 9 states have internal predecessors, (873), 0 states have call successors, (0), 0 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-02 20:57:56,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 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-02 20:57:56,258 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 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-02 20:57:56,258 INFO L175 Difference]: Start difference. First operand has 134 places, 103 transitions, 346 flow. Second operand 9 states and 873 transitions. [2022-11-02 20:57:56,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 142 transitions, 759 flow [2022-11-02 20:57:56,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 142 transitions, 729 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-11-02 20:57:56,268 INFO L231 Difference]: Finished difference. Result has 136 places, 103 transitions, 361 flow [2022-11-02 20:57:56,268 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=361, PETRI_PLACES=136, PETRI_TRANSITIONS=103} [2022-11-02 20:57:56,269 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 19 predicate places. [2022-11-02 20:57:56,269 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 103 transitions, 361 flow [2022-11-02 20:57:56,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 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-02 20:57:56,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:56,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:56,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:57:56,270 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:57:56,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:56,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1553593508, now seen corresponding path program 1 times [2022-11-02 20:57:56,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:56,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350473526] [2022-11-02 20:57:56,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:56,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:56,679 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-02 20:57:56,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:56,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350473526] [2022-11-02 20:57:56,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350473526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:56,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:56,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:57:56,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481384863] [2022-11-02 20:57:56,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:56,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:57:56,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:56,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:57:56,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:57:56,683 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 112 [2022-11-02 20:57:56,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 103 transitions, 361 flow. Second operand has 8 states, 8 states have (on average 91.75) internal successors, (734), 8 states have internal predecessors, (734), 0 states have call successors, (0), 0 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-02 20:57:56,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:56,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 112 [2022-11-02 20:57:56,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:57,198 INFO L130 PetriNetUnfolder]: 392/1091 cut-off events. [2022-11-02 20:57:57,198 INFO L131 PetriNetUnfolder]: For 5658/5759 co-relation queries the response was YES. [2022-11-02 20:57:57,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4173 conditions, 1091 events. 392/1091 cut-off events. For 5658/5759 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7159 event pairs, 128 based on Foata normal form. 25/1029 useless extension candidates. Maximal degree in co-relation 4093. Up to 396 conditions per place. [2022-11-02 20:57:57,214 INFO L137 encePairwiseOnDemand]: 102/112 looper letters, 26 selfloop transitions, 8 changer transitions 19/133 dead transitions. [2022-11-02 20:57:57,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 133 transitions, 693 flow [2022-11-02 20:57:57,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:57:57,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:57:57,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1040 transitions. [2022-11-02 20:57:57,217 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8441558441558441 [2022-11-02 20:57:57,218 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1040 transitions. [2022-11-02 20:57:57,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1040 transitions. [2022-11-02 20:57:57,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:57,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1040 transitions. [2022-11-02 20:57:57,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.54545454545455) internal successors, (1040), 11 states have internal predecessors, (1040), 0 states have call successors, (0), 0 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-02 20:57:57,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 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-02 20:57:57,224 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 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-02 20:57:57,224 INFO L175 Difference]: Start difference. First operand has 136 places, 103 transitions, 361 flow. Second operand 11 states and 1040 transitions. [2022-11-02 20:57:57,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 133 transitions, 693 flow [2022-11-02 20:57:57,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 133 transitions, 644 flow, removed 23 selfloop flow, removed 7 redundant places. [2022-11-02 20:57:57,238 INFO L231 Difference]: Finished difference. Result has 140 places, 106 transitions, 394 flow [2022-11-02 20:57:57,238 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=394, PETRI_PLACES=140, PETRI_TRANSITIONS=106} [2022-11-02 20:57:57,239 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 23 predicate places. [2022-11-02 20:57:57,239 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 106 transitions, 394 flow [2022-11-02 20:57:57,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.75) internal successors, (734), 8 states have internal predecessors, (734), 0 states have call successors, (0), 0 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-02 20:57:57,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:57,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:57,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:57:57,240 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:57:57,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:57,241 INFO L85 PathProgramCache]: Analyzing trace with hash 703272026, now seen corresponding path program 2 times [2022-11-02 20:57:57,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:57,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680034565] [2022-11-02 20:57:57,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:57,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:57,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:57,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:57,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680034565] [2022-11-02 20:57:57,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680034565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:57,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:57,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:57:57,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174393697] [2022-11-02 20:57:57,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:57,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:57:57,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:57,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:57:57,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:57:57,926 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-11-02 20:57:57,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 106 transitions, 394 flow. Second operand has 10 states, 10 states have (on average 90.5) internal successors, (905), 10 states have internal predecessors, (905), 0 states have call successors, (0), 0 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-02 20:57:57,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:57,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-11-02 20:57:57,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:58,442 INFO L130 PetriNetUnfolder]: 349/1001 cut-off events. [2022-11-02 20:57:58,442 INFO L131 PetriNetUnfolder]: For 5363/5644 co-relation queries the response was YES. [2022-11-02 20:57:58,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3963 conditions, 1001 events. 349/1001 cut-off events. For 5363/5644 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6418 event pairs, 112 based on Foata normal form. 28/962 useless extension candidates. Maximal degree in co-relation 3879. Up to 360 conditions per place. [2022-11-02 20:57:58,457 INFO L137 encePairwiseOnDemand]: 103/112 looper letters, 24 selfloop transitions, 7 changer transitions 19/129 dead transitions. [2022-11-02 20:57:58,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 129 transitions, 678 flow [2022-11-02 20:57:58,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:57:58,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-02 20:57:58,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1113 transitions. [2022-11-02 20:57:58,461 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.828125 [2022-11-02 20:57:58,461 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1113 transitions. [2022-11-02 20:57:58,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1113 transitions. [2022-11-02 20:57:58,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:58,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1113 transitions. [2022-11-02 20:57:58,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 92.75) internal successors, (1113), 12 states have internal predecessors, (1113), 0 states have call successors, (0), 0 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-02 20:57:58,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 0 states have call successors, (0), 0 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-02 20:57:58,468 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 0 states have call successors, (0), 0 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-02 20:57:58,468 INFO L175 Difference]: Start difference. First operand has 140 places, 106 transitions, 394 flow. Second operand 12 states and 1113 transitions. [2022-11-02 20:57:58,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 129 transitions, 678 flow [2022-11-02 20:57:58,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 129 transitions, 623 flow, removed 23 selfloop flow, removed 8 redundant places. [2022-11-02 20:57:58,482 INFO L231 Difference]: Finished difference. Result has 144 places, 106 transitions, 395 flow [2022-11-02 20:57:58,482 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=395, PETRI_PLACES=144, PETRI_TRANSITIONS=106} [2022-11-02 20:57:58,483 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 27 predicate places. [2022-11-02 20:57:58,483 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 106 transitions, 395 flow [2022-11-02 20:57:58,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.5) internal successors, (905), 10 states have internal predecessors, (905), 0 states have call successors, (0), 0 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-02 20:57:58,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:58,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:58,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:57:58,484 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:57:58,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:58,485 INFO L85 PathProgramCache]: Analyzing trace with hash 289013689, now seen corresponding path program 1 times [2022-11-02 20:57:58,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:58,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800257613] [2022-11-02 20:57:58,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:58,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:58,721 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-02 20:57:58,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:58,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800257613] [2022-11-02 20:57:58,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800257613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:58,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:58,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:57:58,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143924791] [2022-11-02 20:57:58,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:58,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:57:58,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:58,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:57:58,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:57:58,729 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2022-11-02 20:57:58,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 106 transitions, 395 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 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-02 20:57:58,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:58,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2022-11-02 20:57:58,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:59,324 INFO L130 PetriNetUnfolder]: 454/1514 cut-off events. [2022-11-02 20:57:59,324 INFO L131 PetriNetUnfolder]: For 7796/8228 co-relation queries the response was YES. [2022-11-02 20:57:59,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5812 conditions, 1514 events. 454/1514 cut-off events. For 7796/8228 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11842 event pairs, 118 based on Foata normal form. 42/1468 useless extension candidates. Maximal degree in co-relation 5728. Up to 308 conditions per place. [2022-11-02 20:57:59,345 INFO L137 encePairwiseOnDemand]: 106/112 looper letters, 39 selfloop transitions, 12 changer transitions 6/138 dead transitions. [2022-11-02 20:57:59,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 138 transitions, 784 flow [2022-11-02 20:57:59,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:57:59,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:57:59,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 867 transitions. [2022-11-02 20:57:59,348 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8601190476190477 [2022-11-02 20:57:59,349 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 867 transitions. [2022-11-02 20:57:59,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 867 transitions. [2022-11-02 20:57:59,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:59,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 867 transitions. [2022-11-02 20:57:59,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.33333333333333) internal successors, (867), 9 states have internal predecessors, (867), 0 states have call successors, (0), 0 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-02 20:57:59,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 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-02 20:57:59,355 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 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-02 20:57:59,355 INFO L175 Difference]: Start difference. First operand has 144 places, 106 transitions, 395 flow. Second operand 9 states and 867 transitions. [2022-11-02 20:57:59,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 138 transitions, 784 flow [2022-11-02 20:57:59,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 138 transitions, 699 flow, removed 37 selfloop flow, removed 13 redundant places. [2022-11-02 20:57:59,387 INFO L231 Difference]: Finished difference. Result has 140 places, 115 transitions, 502 flow [2022-11-02 20:57:59,387 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=502, PETRI_PLACES=140, PETRI_TRANSITIONS=115} [2022-11-02 20:57:59,390 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 23 predicate places. [2022-11-02 20:57:59,390 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 115 transitions, 502 flow [2022-11-02 20:57:59,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 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-02 20:57:59,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:59,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:59,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:57:59,392 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:57:59,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:59,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1942204875, now seen corresponding path program 1 times [2022-11-02 20:57:59,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:59,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777578061] [2022-11-02 20:57:59,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:59,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:00,189 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-02 20:58:00,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:00,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777578061] [2022-11-02 20:58:00,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777578061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:00,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:00,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:58:00,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743478246] [2022-11-02 20:58:00,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:00,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:58:00,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:00,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:58:00,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:58:00,193 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-11-02 20:58:00,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 115 transitions, 502 flow. Second operand has 10 states, 10 states have (on average 90.5) internal successors, (905), 10 states have internal predecessors, (905), 0 states have call successors, (0), 0 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-02 20:58:00,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:00,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-11-02 20:58:00,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:00,870 INFO L130 PetriNetUnfolder]: 630/1903 cut-off events. [2022-11-02 20:58:00,870 INFO L131 PetriNetUnfolder]: For 9374/9583 co-relation queries the response was YES. [2022-11-02 20:58:00,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7298 conditions, 1903 events. 630/1903 cut-off events. For 9374/9583 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 16041 event pairs, 242 based on Foata normal form. 53/1812 useless extension candidates. Maximal degree in co-relation 7216. Up to 552 conditions per place. [2022-11-02 20:58:00,891 INFO L137 encePairwiseOnDemand]: 101/112 looper letters, 20 selfloop transitions, 10 changer transitions 41/150 dead transitions. [2022-11-02 20:58:00,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 150 transitions, 944 flow [2022-11-02 20:58:00,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:58:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-02 20:58:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1206 transitions. [2022-11-02 20:58:00,895 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8282967032967034 [2022-11-02 20:58:00,895 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1206 transitions. [2022-11-02 20:58:00,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1206 transitions. [2022-11-02 20:58:00,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:00,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1206 transitions. [2022-11-02 20:58:00,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 92.76923076923077) internal successors, (1206), 13 states have internal predecessors, (1206), 0 states have call successors, (0), 0 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-02 20:58:00,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 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-02 20:58:00,902 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 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-02 20:58:00,903 INFO L175 Difference]: Start difference. First operand has 140 places, 115 transitions, 502 flow. Second operand 13 states and 1206 transitions. [2022-11-02 20:58:00,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 150 transitions, 944 flow [2022-11-02 20:58:00,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 150 transitions, 883 flow, removed 29 selfloop flow, removed 1 redundant places. [2022-11-02 20:58:00,928 INFO L231 Difference]: Finished difference. Result has 158 places, 107 transitions, 434 flow [2022-11-02 20:58:00,928 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=434, PETRI_PLACES=158, PETRI_TRANSITIONS=107} [2022-11-02 20:58:00,929 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 41 predicate places. [2022-11-02 20:58:00,929 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 107 transitions, 434 flow [2022-11-02 20:58:00,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.5) internal successors, (905), 10 states have internal predecessors, (905), 0 states have call successors, (0), 0 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-02 20:58:00,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:00,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:00,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:58:00,930 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:58:00,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:00,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1635822944, now seen corresponding path program 1 times [2022-11-02 20:58:00,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:00,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034627338] [2022-11-02 20:58:00,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:00,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:01,691 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-02 20:58:01,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:01,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034627338] [2022-11-02 20:58:01,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034627338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:01,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:01,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:58:01,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930083687] [2022-11-02 20:58:01,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:01,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:58:01,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:01,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:58:01,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:58:01,695 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-11-02 20:58:01,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 107 transitions, 434 flow. Second operand has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 0 states have call successors, (0), 0 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-02 20:58:01,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:01,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-11-02 20:58:01,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:02,312 INFO L130 PetriNetUnfolder]: 321/1098 cut-off events. [2022-11-02 20:58:02,312 INFO L131 PetriNetUnfolder]: For 10015/10197 co-relation queries the response was YES. [2022-11-02 20:58:02,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5057 conditions, 1098 events. 321/1098 cut-off events. For 10015/10197 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7949 event pairs, 133 based on Foata normal form. 40/1033 useless extension candidates. Maximal degree in co-relation 4964. Up to 342 conditions per place. [2022-11-02 20:58:02,327 INFO L137 encePairwiseOnDemand]: 101/112 looper letters, 26 selfloop transitions, 9 changer transitions 19/133 dead transitions. [2022-11-02 20:58:02,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 133 transitions, 810 flow [2022-11-02 20:58:02,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:58:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-02 20:58:02,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1205 transitions. [2022-11-02 20:58:02,332 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8276098901098901 [2022-11-02 20:58:02,332 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1205 transitions. [2022-11-02 20:58:02,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1205 transitions. [2022-11-02 20:58:02,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:02,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1205 transitions. [2022-11-02 20:58:02,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 92.6923076923077) internal successors, (1205), 13 states have internal predecessors, (1205), 0 states have call successors, (0), 0 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-02 20:58:02,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 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-02 20:58:02,340 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 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-02 20:58:02,341 INFO L175 Difference]: Start difference. First operand has 158 places, 107 transitions, 434 flow. Second operand 13 states and 1205 transitions. [2022-11-02 20:58:02,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 133 transitions, 810 flow [2022-11-02 20:58:02,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 133 transitions, 743 flow, removed 26 selfloop flow, removed 14 redundant places. [2022-11-02 20:58:02,361 INFO L231 Difference]: Finished difference. Result has 151 places, 109 transitions, 465 flow [2022-11-02 20:58:02,362 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=465, PETRI_PLACES=151, PETRI_TRANSITIONS=109} [2022-11-02 20:58:02,363 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 34 predicate places. [2022-11-02 20:58:02,363 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 109 transitions, 465 flow [2022-11-02 20:58:02,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 0 states have call successors, (0), 0 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-02 20:58:02,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:02,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:02,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:58:02,364 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:58:02,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:02,365 INFO L85 PathProgramCache]: Analyzing trace with hash 423310144, now seen corresponding path program 2 times [2022-11-02 20:58:02,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:02,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702130965] [2022-11-02 20:58:02,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:02,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:03,138 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-02 20:58:03,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:03,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702130965] [2022-11-02 20:58:03,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702130965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:03,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:03,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:58:03,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207236818] [2022-11-02 20:58:03,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:03,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:58:03,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:03,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:58:03,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:58:03,143 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 112 [2022-11-02 20:58:03,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 109 transitions, 465 flow. Second operand has 11 states, 11 states have (on average 88.63636363636364) internal successors, (975), 11 states have internal predecessors, (975), 0 states have call successors, (0), 0 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-02 20:58:03,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:03,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 112 [2022-11-02 20:58:03,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:03,722 INFO L130 PetriNetUnfolder]: 256/957 cut-off events. [2022-11-02 20:58:03,722 INFO L131 PetriNetUnfolder]: For 10264/10667 co-relation queries the response was YES. [2022-11-02 20:58:03,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4758 conditions, 957 events. 256/957 cut-off events. For 10264/10667 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6955 event pairs, 87 based on Foata normal form. 38/904 useless extension candidates. Maximal degree in co-relation 4666. Up to 238 conditions per place. [2022-11-02 20:58:03,735 INFO L137 encePairwiseOnDemand]: 101/112 looper letters, 30 selfloop transitions, 11 changer transitions 19/137 dead transitions. [2022-11-02 20:58:03,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 137 transitions, 1001 flow [2022-11-02 20:58:03,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:58:03,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-02 20:58:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1182 transitions. [2022-11-02 20:58:03,739 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8118131868131868 [2022-11-02 20:58:03,739 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1182 transitions. [2022-11-02 20:58:03,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1182 transitions. [2022-11-02 20:58:03,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:03,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1182 transitions. [2022-11-02 20:58:03,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 90.92307692307692) internal successors, (1182), 13 states have internal predecessors, (1182), 0 states have call successors, (0), 0 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-02 20:58:03,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 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-02 20:58:03,746 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 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-02 20:58:03,746 INFO L175 Difference]: Start difference. First operand has 151 places, 109 transitions, 465 flow. Second operand 13 states and 1182 transitions. [2022-11-02 20:58:03,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 137 transitions, 1001 flow [2022-11-02 20:58:03,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 137 transitions, 885 flow, removed 51 selfloop flow, removed 11 redundant places. [2022-11-02 20:58:03,764 INFO L231 Difference]: Finished difference. Result has 153 places, 111 transitions, 508 flow [2022-11-02 20:58:03,764 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=508, PETRI_PLACES=153, PETRI_TRANSITIONS=111} [2022-11-02 20:58:03,765 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 36 predicate places. [2022-11-02 20:58:03,765 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 111 transitions, 508 flow [2022-11-02 20:58:03,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 88.63636363636364) internal successors, (975), 11 states have internal predecessors, (975), 0 states have call successors, (0), 0 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-02 20:58:03,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:03,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:03,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:58:03,767 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:58:03,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:03,768 INFO L85 PathProgramCache]: Analyzing trace with hash -243566072, now seen corresponding path program 1 times [2022-11-02 20:58:03,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:03,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511814675] [2022-11-02 20:58:03,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:03,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:04,754 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-02 20:58:04,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:04,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511814675] [2022-11-02 20:58:04,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511814675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:04,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:04,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:58:04,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790012866] [2022-11-02 20:58:04,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:04,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:58:04,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:04,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:58:04,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:58:04,758 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-11-02 20:58:04,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 111 transitions, 508 flow. Second operand has 11 states, 11 states have (on average 89.63636363636364) internal successors, (986), 11 states have internal predecessors, (986), 0 states have call successors, (0), 0 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-02 20:58:04,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:04,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-11-02 20:58:04,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:05,287 INFO L130 PetriNetUnfolder]: 190/820 cut-off events. [2022-11-02 20:58:05,287 INFO L131 PetriNetUnfolder]: For 8876/9106 co-relation queries the response was YES. [2022-11-02 20:58:05,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3904 conditions, 820 events. 190/820 cut-off events. For 8876/9106 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5653 event pairs, 72 based on Foata normal form. 28/774 useless extension candidates. Maximal degree in co-relation 3812. Up to 280 conditions per place. [2022-11-02 20:58:05,300 INFO L137 encePairwiseOnDemand]: 100/112 looper letters, 29 selfloop transitions, 11 changer transitions 10/128 dead transitions. [2022-11-02 20:58:05,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 128 transitions, 852 flow [2022-11-02 20:58:05,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:58:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-02 20:58:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1185 transitions. [2022-11-02 20:58:05,303 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8138736263736264 [2022-11-02 20:58:05,304 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1185 transitions. [2022-11-02 20:58:05,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1185 transitions. [2022-11-02 20:58:05,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:05,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1185 transitions. [2022-11-02 20:58:05,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 91.15384615384616) internal successors, (1185), 13 states have internal predecessors, (1185), 0 states have call successors, (0), 0 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-02 20:58:05,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 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-02 20:58:05,310 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 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-02 20:58:05,310 INFO L175 Difference]: Start difference. First operand has 153 places, 111 transitions, 508 flow. Second operand 13 states and 1185 transitions. [2022-11-02 20:58:05,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 128 transitions, 852 flow [2022-11-02 20:58:05,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 128 transitions, 767 flow, removed 38 selfloop flow, removed 10 redundant places. [2022-11-02 20:58:05,331 INFO L231 Difference]: Finished difference. Result has 156 places, 113 transitions, 546 flow [2022-11-02 20:58:05,332 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=546, PETRI_PLACES=156, PETRI_TRANSITIONS=113} [2022-11-02 20:58:05,332 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 39 predicate places. [2022-11-02 20:58:05,333 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 113 transitions, 546 flow [2022-11-02 20:58:05,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.63636363636364) internal successors, (986), 11 states have internal predecessors, (986), 0 states have call successors, (0), 0 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-02 20:58:05,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:05,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:05,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:58:05,334 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:58:05,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:05,334 INFO L85 PathProgramCache]: Analyzing trace with hash 895466230, now seen corresponding path program 2 times [2022-11-02 20:58:05,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:05,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832872500] [2022-11-02 20:58:05,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:05,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:06,246 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-02 20:58:06,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:06,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832872500] [2022-11-02 20:58:06,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832872500] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:06,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:06,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:58:06,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918148226] [2022-11-02 20:58:06,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:06,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:58:06,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:06,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:58:06,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:58:06,250 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 112 [2022-11-02 20:58:06,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 113 transitions, 546 flow. Second operand has 13 states, 13 states have (on average 87.53846153846153) internal successors, (1138), 13 states have internal predecessors, (1138), 0 states have call successors, (0), 0 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-02 20:58:06,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:06,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 112 [2022-11-02 20:58:06,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:06,878 INFO L130 PetriNetUnfolder]: 191/821 cut-off events. [2022-11-02 20:58:06,887 INFO L131 PetriNetUnfolder]: For 9287/9781 co-relation queries the response was YES. [2022-11-02 20:58:06,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3967 conditions, 821 events. 191/821 cut-off events. For 9287/9781 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5780 event pairs, 74 based on Foata normal form. 23/771 useless extension candidates. Maximal degree in co-relation 3872. Up to 280 conditions per place. [2022-11-02 20:58:06,900 INFO L137 encePairwiseOnDemand]: 100/112 looper letters, 29 selfloop transitions, 15 changer transitions 10/130 dead transitions. [2022-11-02 20:58:06,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 130 transitions, 908 flow [2022-11-02 20:58:06,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:58:06,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-02 20:58:06,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1246 transitions. [2022-11-02 20:58:06,906 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7946428571428571 [2022-11-02 20:58:06,906 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1246 transitions. [2022-11-02 20:58:06,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1246 transitions. [2022-11-02 20:58:06,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:06,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1246 transitions. [2022-11-02 20:58:06,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 89.0) internal successors, (1246), 14 states have internal predecessors, (1246), 0 states have call successors, (0), 0 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-02 20:58:06,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 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-02 20:58:06,929 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 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-02 20:58:06,929 INFO L175 Difference]: Start difference. First operand has 156 places, 113 transitions, 546 flow. Second operand 14 states and 1246 transitions. [2022-11-02 20:58:06,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 130 transitions, 908 flow [2022-11-02 20:58:06,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 130 transitions, 813 flow, removed 37 selfloop flow, removed 11 redundant places. [2022-11-02 20:58:06,957 INFO L231 Difference]: Finished difference. Result has 160 places, 117 transitions, 614 flow [2022-11-02 20:58:06,957 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=614, PETRI_PLACES=160, PETRI_TRANSITIONS=117} [2022-11-02 20:58:06,958 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 43 predicate places. [2022-11-02 20:58:06,959 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 117 transitions, 614 flow [2022-11-02 20:58:06,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 87.53846153846153) internal successors, (1138), 13 states have internal predecessors, (1138), 0 states have call successors, (0), 0 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-02 20:58:06,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:06,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:06,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:58:06,960 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:58:06,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:06,961 INFO L85 PathProgramCache]: Analyzing trace with hash -693206800, now seen corresponding path program 3 times [2022-11-02 20:58:06,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:06,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268960196] [2022-11-02 20:58:06,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:06,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:07,817 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-02 20:58:07,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:07,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268960196] [2022-11-02 20:58:07,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268960196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:07,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:07,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:58:07,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501365744] [2022-11-02 20:58:07,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:07,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:58:07,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:07,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:58:07,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:58:07,821 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 112 [2022-11-02 20:58:07,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 117 transitions, 614 flow. Second operand has 11 states, 11 states have (on average 88.72727272727273) internal successors, (976), 11 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:07,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:07,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 112 [2022-11-02 20:58:07,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:08,321 INFO L130 PetriNetUnfolder]: 150/781 cut-off events. [2022-11-02 20:58:08,322 INFO L131 PetriNetUnfolder]: For 7212/7744 co-relation queries the response was YES. [2022-11-02 20:58:08,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3447 conditions, 781 events. 150/781 cut-off events. For 7212/7744 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5718 event pairs, 38 based on Foata normal form. 24/739 useless extension candidates. Maximal degree in co-relation 3350. Up to 139 conditions per place. [2022-11-02 20:58:08,338 INFO L137 encePairwiseOnDemand]: 102/112 looper letters, 34 selfloop transitions, 12 changer transitions 10/133 dead transitions. [2022-11-02 20:58:08,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 133 transitions, 966 flow [2022-11-02 20:58:08,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:58:08,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-02 20:58:08,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1173 transitions. [2022-11-02 20:58:08,344 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8056318681318682 [2022-11-02 20:58:08,344 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1173 transitions. [2022-11-02 20:58:08,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1173 transitions. [2022-11-02 20:58:08,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:08,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1173 transitions. [2022-11-02 20:58:08,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 90.23076923076923) internal successors, (1173), 13 states have internal predecessors, (1173), 0 states have call successors, (0), 0 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-02 20:58:08,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 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-02 20:58:08,349 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 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-02 20:58:08,349 INFO L175 Difference]: Start difference. First operand has 160 places, 117 transitions, 614 flow. Second operand 13 states and 1173 transitions. [2022-11-02 20:58:08,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 133 transitions, 966 flow [2022-11-02 20:58:08,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 133 transitions, 837 flow, removed 58 selfloop flow, removed 10 redundant places. [2022-11-02 20:58:08,372 INFO L231 Difference]: Finished difference. Result has 163 places, 117 transitions, 588 flow [2022-11-02 20:58:08,373 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=588, PETRI_PLACES=163, PETRI_TRANSITIONS=117} [2022-11-02 20:58:08,374 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 46 predicate places. [2022-11-02 20:58:08,374 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 117 transitions, 588 flow [2022-11-02 20:58:08,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 88.72727272727273) internal successors, (976), 11 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:08,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:08,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:08,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:58:08,375 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:58:08,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:08,376 INFO L85 PathProgramCache]: Analyzing trace with hash 732521874, now seen corresponding path program 1 times [2022-11-02 20:58:08,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:08,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548196720] [2022-11-02 20:58:08,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:08,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:08,587 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-02 20:58:08,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:08,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548196720] [2022-11-02 20:58:08,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548196720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:08,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:08,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:58:08,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117536046] [2022-11-02 20:58:08,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:08,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:58:08,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:08,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:58:08,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:58:08,590 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-11-02 20:58:08,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 117 transitions, 588 flow. Second operand has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 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-02 20:58:08,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:08,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-11-02 20:58:08,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:10,131 INFO L130 PetriNetUnfolder]: 3068/5981 cut-off events. [2022-11-02 20:58:10,131 INFO L131 PetriNetUnfolder]: For 35336/35884 co-relation queries the response was YES. [2022-11-02 20:58:10,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20979 conditions, 5981 events. 3068/5981 cut-off events. For 35336/35884 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 49216 event pairs, 106 based on Foata normal form. 387/5979 useless extension candidates. Maximal degree in co-relation 20886. Up to 2057 conditions per place. [2022-11-02 20:58:10,178 INFO L137 encePairwiseOnDemand]: 102/112 looper letters, 47 selfloop transitions, 6 changer transitions 107/240 dead transitions. [2022-11-02 20:58:10,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 240 transitions, 2122 flow [2022-11-02 20:58:10,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:58:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:58:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 964 transitions. [2022-11-02 20:58:10,183 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8607142857142858 [2022-11-02 20:58:10,183 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 964 transitions. [2022-11-02 20:58:10,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 964 transitions. [2022-11-02 20:58:10,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:10,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 964 transitions. [2022-11-02 20:58:10,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.4) internal successors, (964), 10 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:10,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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-02 20:58:10,189 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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-02 20:58:10,190 INFO L175 Difference]: Start difference. First operand has 163 places, 117 transitions, 588 flow. Second operand 10 states and 964 transitions. [2022-11-02 20:58:10,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 240 transitions, 2122 flow [2022-11-02 20:58:10,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 240 transitions, 1913 flow, removed 67 selfloop flow, removed 14 redundant places. [2022-11-02 20:58:10,237 INFO L231 Difference]: Finished difference. Result has 158 places, 113 transitions, 537 flow [2022-11-02 20:58:10,238 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=537, PETRI_PLACES=158, PETRI_TRANSITIONS=113} [2022-11-02 20:58:10,239 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 41 predicate places. [2022-11-02 20:58:10,239 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 113 transitions, 537 flow [2022-11-02 20:58:10,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 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-02 20:58:10,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:10,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:10,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:58:10,240 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:58:10,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:10,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1639052179, now seen corresponding path program 1 times [2022-11-02 20:58:10,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:10,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799025794] [2022-11-02 20:58:10,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:10,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:10,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:10,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799025794] [2022-11-02 20:58:10,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799025794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:10,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:10,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:58:10,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039050861] [2022-11-02 20:58:10,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:10,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:58:10,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:10,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:58:10,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:58:10,517 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-11-02 20:58:10,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 113 transitions, 537 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 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-02 20:58:10,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:10,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-11-02 20:58:10,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:11,139 INFO L130 PetriNetUnfolder]: 684/1883 cut-off events. [2022-11-02 20:58:11,139 INFO L131 PetriNetUnfolder]: For 8579/8763 co-relation queries the response was YES. [2022-11-02 20:58:11,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7406 conditions, 1883 events. 684/1883 cut-off events. For 8579/8763 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 14815 event pairs, 26 based on Foata normal form. 179/2015 useless extension candidates. Maximal degree in co-relation 7317. Up to 595 conditions per place. [2022-11-02 20:58:11,153 INFO L137 encePairwiseOnDemand]: 103/112 looper letters, 42 selfloop transitions, 9 changer transitions 71/201 dead transitions. [2022-11-02 20:58:11,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 201 transitions, 1654 flow [2022-11-02 20:58:11,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:58:11,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:58:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 962 transitions. [2022-11-02 20:58:11,159 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8589285714285714 [2022-11-02 20:58:11,159 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 962 transitions. [2022-11-02 20:58:11,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 962 transitions. [2022-11-02 20:58:11,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:11,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 962 transitions. [2022-11-02 20:58:11,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.2) internal successors, (962), 10 states have internal predecessors, (962), 0 states have call successors, (0), 0 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-02 20:58:11,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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-02 20:58:11,173 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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-02 20:58:11,174 INFO L175 Difference]: Start difference. First operand has 158 places, 113 transitions, 537 flow. Second operand 10 states and 962 transitions. [2022-11-02 20:58:11,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 201 transitions, 1654 flow [2022-11-02 20:58:11,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 201 transitions, 1522 flow, removed 17 selfloop flow, removed 13 redundant places. [2022-11-02 20:58:11,200 INFO L231 Difference]: Finished difference. Result has 154 places, 113 transitions, 549 flow [2022-11-02 20:58:11,200 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=549, PETRI_PLACES=154, PETRI_TRANSITIONS=113} [2022-11-02 20:58:11,201 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 37 predicate places. [2022-11-02 20:58:11,201 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 113 transitions, 549 flow [2022-11-02 20:58:11,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 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-02 20:58:11,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:11,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:11,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:58:11,202 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:58:11,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:11,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2020955958, now seen corresponding path program 1 times [2022-11-02 20:58:11,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:11,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943233201] [2022-11-02 20:58:11,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:11,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:11,436 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-02 20:58:11,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:11,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943233201] [2022-11-02 20:58:11,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943233201] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:11,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:11,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:58:11,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21798206] [2022-11-02 20:58:11,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:11,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:58:11,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:11,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:58:11,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:58:11,440 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-11-02 20:58:11,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 113 transitions, 549 flow. Second operand has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 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-02 20:58:11,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:11,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-11-02 20:58:11,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:11,782 INFO L130 PetriNetUnfolder]: 188/789 cut-off events. [2022-11-02 20:58:11,783 INFO L131 PetriNetUnfolder]: For 3691/3803 co-relation queries the response was YES. [2022-11-02 20:58:11,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3045 conditions, 789 events. 188/789 cut-off events. For 3691/3803 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5485 event pairs, 2 based on Foata normal form. 68/837 useless extension candidates. Maximal degree in co-relation 2958. Up to 213 conditions per place. [2022-11-02 20:58:11,790 INFO L137 encePairwiseOnDemand]: 103/112 looper letters, 20 selfloop transitions, 12 changer transitions 54/160 dead transitions. [2022-11-02 20:58:11,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 160 transitions, 1168 flow [2022-11-02 20:58:11,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:58:11,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:58:11,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1033 transitions. [2022-11-02 20:58:11,796 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.838474025974026 [2022-11-02 20:58:11,796 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1033 transitions. [2022-11-02 20:58:11,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1033 transitions. [2022-11-02 20:58:11,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:11,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1033 transitions. [2022-11-02 20:58:11,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 93.9090909090909) internal successors, (1033), 11 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-02 20:58:11,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 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-02 20:58:11,805 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 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-02 20:58:11,806 INFO L175 Difference]: Start difference. First operand has 154 places, 113 transitions, 549 flow. Second operand 11 states and 1033 transitions. [2022-11-02 20:58:11,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 160 transitions, 1168 flow [2022-11-02 20:58:11,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 160 transitions, 927 flow, removed 106 selfloop flow, removed 17 redundant places. [2022-11-02 20:58:11,822 INFO L231 Difference]: Finished difference. Result has 149 places, 100 transitions, 376 flow [2022-11-02 20:58:11,823 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=376, PETRI_PLACES=149, PETRI_TRANSITIONS=100} [2022-11-02 20:58:11,823 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 32 predicate places. [2022-11-02 20:58:11,824 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 100 transitions, 376 flow [2022-11-02 20:58:11,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 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-02 20:58:11,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:11,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:11,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:58:11,825 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:58:11,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:11,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1355815032, now seen corresponding path program 1 times [2022-11-02 20:58:11,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:11,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607998991] [2022-11-02 20:58:11,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:11,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:58:11,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:58:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:58:11,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:58:11,950 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:58:11,951 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-02 20:58:11,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-02 20:58:11,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-02 20:58:11,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-02 20:58:11,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-02 20:58:11,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-02 20:58:11,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:58:11,954 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:11,961 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:58:11,961 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:58:12,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:58:12 BasicIcfg [2022-11-02 20:58:12,117 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:58:12,118 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:58:12,118 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:58:12,118 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:58:12,119 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:50" (3/4) ... [2022-11-02 20:58:12,120 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 20:58:12,256 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac91cd17-53a1-4e6b-9c6c-faeacb748f8c/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:58:12,256 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:58:12,257 INFO L158 Benchmark]: Toolchain (without parser) took 23900.36ms. Allocated memory was 115.3MB in the beginning and 522.2MB in the end (delta: 406.8MB). Free memory was 81.8MB in the beginning and 399.8MB in the end (delta: -318.1MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. [2022-11-02 20:58:12,260 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 81.8MB. Free memory was 39.0MB in the beginning and 38.9MB in the end (delta: 46.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:58:12,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 692.20ms. Allocated memory is still 115.3MB. Free memory was 81.5MB in the beginning and 77.9MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:58:12,261 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.74ms. Allocated memory is still 115.3MB. Free memory was 77.9MB in the beginning and 74.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:58:12,261 INFO L158 Benchmark]: Boogie Preprocessor took 70.53ms. Allocated memory is still 115.3MB. Free memory was 74.7MB in the beginning and 72.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:58:12,262 INFO L158 Benchmark]: RCFGBuilder took 1393.36ms. Allocated memory is still 115.3MB. Free memory was 72.5MB in the beginning and 60.6MB in the end (delta: 12.0MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2022-11-02 20:58:12,262 INFO L158 Benchmark]: TraceAbstraction took 21505.09ms. Allocated memory was 115.3MB in the beginning and 522.2MB in the end (delta: 406.8MB). Free memory was 60.2MB in the beginning and 423.9MB in the end (delta: -363.7MB). Peak memory consumption was 323.1MB. Max. memory is 16.1GB. [2022-11-02 20:58:12,262 INFO L158 Benchmark]: Witness Printer took 138.79ms. Allocated memory is still 522.2MB. Free memory was 423.9MB in the beginning and 399.8MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-02 20:58:12,265 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.24ms. Allocated memory is still 81.8MB. Free memory was 39.0MB in the beginning and 38.9MB in the end (delta: 46.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 692.20ms. Allocated memory is still 115.3MB. Free memory was 81.5MB in the beginning and 77.9MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.74ms. Allocated memory is still 115.3MB. Free memory was 77.9MB in the beginning and 74.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.53ms. Allocated memory is still 115.3MB. Free memory was 74.7MB in the beginning and 72.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1393.36ms. Allocated memory is still 115.3MB. Free memory was 72.5MB in the beginning and 60.6MB in the end (delta: 12.0MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21505.09ms. Allocated memory was 115.3MB in the beginning and 522.2MB in the end (delta: 406.8MB). Free memory was 60.2MB in the beginning and 423.9MB in the end (delta: -363.7MB). Peak memory consumption was 323.1MB. Max. memory is 16.1GB. * Witness Printer took 138.79ms. Allocated memory is still 522.2MB. Free memory was 423.9MB in the beginning and 399.8MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L716] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L717] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L718] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L719] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L720] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L721] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L725] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L726] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L727] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L728] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L729] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L730] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L731] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 0 pthread_t t2492; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492, ((void *)0), P0, ((void *)0))=-2, t2492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2493; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493, ((void *)0), P1, ((void *)0))=-1, t2492={5:0}, t2493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2494; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494, ((void *)0), P2, ((void *)0))=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L834] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L836] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L839] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 812]: 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: 816]: 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: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.2s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 684 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 684 mSDsluCounter, 744 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1113 mSDsCounter, 212 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1935 IncrementalHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 212 mSolverCounterUnsat, 153 mSDtfsCounter, 1935 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=614occurred in iteration=13, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 1392 NumberOfCodeBlocks, 1392 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1289 ConstructedInterpolants, 0 QuantifiedInterpolants, 7083 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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-02 20:58:12,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac91cd17-53a1-4e6b-9c6c-faeacb748f8c/bin/uautomizer-Dbtcem3rbc/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