./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e45b25-e2a6-48c8-ad21-7a9f6e9f93c4/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e45b25-e2a6-48c8-ad21-7a9f6e9f93c4/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e45b25-e2a6-48c8-ad21-7a9f6e9f93c4/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e45b25-e2a6-48c8-ad21-7a9f6e9f93c4/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e45b25-e2a6-48c8-ad21-7a9f6e9f93c4/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e45b25-e2a6-48c8-ad21-7a9f6e9f93c4/bin/uautomizer-tPACEb0tL8 --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 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 --- 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-e04fb08 [2022-11-16 11:02:03,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:02:03,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:02:03,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:02:03,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:02:03,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:02:03,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:02:03,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:02:03,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:02:03,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:02:03,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:02:03,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:02:03,935 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:02:03,942 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:02:03,943 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:02:03,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:02:03,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:02:03,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:02:03,951 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:02:03,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:02:03,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:02:03,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:02:03,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:02:03,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:02:03,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:02:03,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:02:03,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:02:03,980 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:02:03,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:02:03,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:02:03,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:02:03,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:02:03,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:02:03,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:02:03,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:02:03,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:02:03,990 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:02:03,991 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:02:03,991 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:02:03,992 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:02:03,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:02:03,994 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e45b25-e2a6-48c8-ad21-7a9f6e9f93c4/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:02:04,040 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:02:04,041 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:02:04,042 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:02:04,043 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:02:04,044 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:02:04,044 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:02:04,045 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:02:04,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:02:04,046 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:02:04,046 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:02:04,047 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:02:04,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:02:04,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:02:04,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:02:04,049 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:02:04,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:02:04,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:02:04,050 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:02:04,050 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:02:04,050 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:02:04,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:02:04,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:02:04,051 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:02:04,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:02:04,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:02:04,053 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:02:04,053 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:02:04,053 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:02:04,054 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:02:04,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:02:04,054 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:02:04,055 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:02:04,055 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:02:04,055 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_d2e45b25-e2a6-48c8-ad21-7a9f6e9f93c4/bin/uautomizer-tPACEb0tL8/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_d2e45b25-e2a6-48c8-ad21-7a9f6e9f93c4/bin/uautomizer-tPACEb0tL8 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 -> 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 [2022-11-16 11:02:04,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:02:04,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:02:04,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:02:04,479 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:02:04,480 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:02:04,482 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e45b25-e2a6-48c8-ad21-7a9f6e9f93c4/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2022-11-16 11:02:04,604 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e45b25-e2a6-48c8-ad21-7a9f6e9f93c4/bin/uautomizer-tPACEb0tL8/data/91c8e8d1e/c7a424dc9fa94c84b3465e73c0c87440/FLAGf88f85cef [2022-11-16 11:02:05,215 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:02:05,215 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e45b25-e2a6-48c8-ad21-7a9f6e9f93c4/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2022-11-16 11:02:05,235 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e45b25-e2a6-48c8-ad21-7a9f6e9f93c4/bin/uautomizer-tPACEb0tL8/data/91c8e8d1e/c7a424dc9fa94c84b3465e73c0c87440/FLAGf88f85cef [2022-11-16 11:02:05,491 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e45b25-e2a6-48c8-ad21-7a9f6e9f93c4/bin/uautomizer-tPACEb0tL8/data/91c8e8d1e/c7a424dc9fa94c84b3465e73c0c87440 [2022-11-16 11:02:05,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:02:05,497 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:02:05,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:02:05,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:02:05,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:02:05,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:02:05" (1/1) ... [2022-11-16 11:02:05,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4de770a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:05, skipping insertion in model container [2022-11-16 11:02:05,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:02:05" (1/1) ... [2022-11-16 11:02:05,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:02:05,598 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:02:05,819 WARN L229 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_d2e45b25-e2a6-48c8-ad21-7a9f6e9f93c4/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2022-11-16 11:02:06,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:02:06,172 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:02:06,190 WARN L229 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_d2e45b25-e2a6-48c8-ad21-7a9f6e9f93c4/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2022-11-16 11:02:06,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:02:06,283 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:02:06,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:06 WrapperNode [2022-11-16 11:02:06,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:02:06,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:02:06,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:02:06,286 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:02:06,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:06" (1/1) ... [2022-11-16 11:02:06,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:06" (1/1) ... [2022-11-16 11:02:06,381 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2022-11-16 11:02:06,381 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:02:06,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:02:06,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:02:06,382 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:02:06,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:06" (1/1) ... [2022-11-16 11:02:06,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:06" (1/1) ... [2022-11-16 11:02:06,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:06" (1/1) ... [2022-11-16 11:02:06,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:06" (1/1) ... [2022-11-16 11:02:06,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:06" (1/1) ... [2022-11-16 11:02:06,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:06" (1/1) ... [2022-11-16 11:02:06,442 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:06" (1/1) ... [2022-11-16 11:02:06,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:06" (1/1) ... [2022-11-16 11:02:06,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:02:06,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:02:06,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:02:06,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:02:06,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:06" (1/1) ... [2022-11-16 11:02:06,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:02:06,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e45b25-e2a6-48c8-ad21-7a9f6e9f93c4/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:02:06,490 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e45b25-e2a6-48c8-ad21-7a9f6e9f93c4/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:02:06,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e45b25-e2a6-48c8-ad21-7a9f6e9f93c4/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:02:06,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:02:06,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:02:06,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:02:06,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:02:06,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:02:06,556 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:02:06,556 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:02:06,557 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:02:06,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:02:06,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:02:06,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:02:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:02:06,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:02:06,561 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:02:06,800 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:02:06,802 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:02:07,182 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:02:07,448 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:02:07,448 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:02:07,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:02:07 BoogieIcfgContainer [2022-11-16 11:02:07,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:02:07,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:02:07,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:02:07,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:02:07,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:02:05" (1/3) ... [2022-11-16 11:02:07,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44aaffd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:02:07, skipping insertion in model container [2022-11-16 11:02:07,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:06" (2/3) ... [2022-11-16 11:02:07,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44aaffd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:02:07, skipping insertion in model container [2022-11-16 11:02:07,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:02:07" (3/3) ... [2022-11-16 11:02:07,463 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2022-11-16 11:02:07,474 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:02:07,487 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:02:07,487 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 11:02:07,487 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:02:07,574 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:02:07,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 93 transitions, 196 flow [2022-11-16 11:02:07,713 INFO L130 PetriNetUnfolder]: 2/91 cut-off events. [2022-11-16 11:02:07,714 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:02:07,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-11-16 11:02:07,719 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 93 transitions, 196 flow [2022-11-16 11:02:07,726 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 91 transitions, 188 flow [2022-11-16 11:02:07,736 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:02:07,743 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;@6f250b20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:02:07,743 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-16 11:02:07,758 INFO L130 PetriNetUnfolder]: 0/55 cut-off events. [2022-11-16 11:02:07,759 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:02:07,759 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:07,760 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:02:07,760 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 11:02:07,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:07,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1040540280, now seen corresponding path program 1 times [2022-11-16 11:02:07,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:07,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502465402] [2022-11-16 11:02:07,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:07,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:08,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-16 11:02:08,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:08,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502465402] [2022-11-16 11:02:08,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502465402] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:08,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:08,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:02:08,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083892512] [2022-11-16 11:02:08,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:08,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:02:08,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:08,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:02:08,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:02:08,652 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 93 [2022-11-16 11:02:08,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:08,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:08,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 93 [2022-11-16 11:02:08,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:08,783 INFO L130 PetriNetUnfolder]: 17/213 cut-off events. [2022-11-16 11:02:08,783 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-16 11:02:08,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 213 events. 17/213 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 685 event pairs, 7 based on Foata normal form. 8/209 useless extension candidates. Maximal degree in co-relation 215. Up to 27 conditions per place. [2022-11-16 11:02:08,788 INFO L137 encePairwiseOnDemand]: 88/93 looper letters, 9 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2022-11-16 11:02:08,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 90 transitions, 208 flow [2022-11-16 11:02:08,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:02:08,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:02:08,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2022-11-16 11:02:08,804 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9283154121863799 [2022-11-16 11:02:08,805 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 259 transitions. [2022-11-16 11:02:08,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 259 transitions. [2022-11-16 11:02:08,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:08,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 259 transitions. [2022-11-16 11:02:08,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:08,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:08,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:08,823 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 188 flow. Second operand 3 states and 259 transitions. [2022-11-16 11:02:08,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 90 transitions, 208 flow [2022-11-16 11:02:08,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 90 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:02:08,831 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 182 flow [2022-11-16 11:02:08,834 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2022-11-16 11:02:08,838 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, -2 predicate places. [2022-11-16 11:02:08,839 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 182 flow [2022-11-16 11:02:08,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:08,840 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:08,840 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:02:08,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:02:08,841 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 11:02:08,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:08,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1833462478, now seen corresponding path program 1 times [2022-11-16 11:02:08,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:08,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255309745] [2022-11-16 11:02:08,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:08,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:09,995 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-16 11:02:09,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:09,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255309745] [2022-11-16 11:02:09,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255309745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:09,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:09,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 11:02:09,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766644664] [2022-11-16 11:02:09,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:09,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:02:09,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:09,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:02:10,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:02:10,002 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2022-11-16 11:02:10,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 182 flow. Second operand has 9 states, 9 states have (on average 73.33333333333333) internal successors, (660), 9 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:10,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:10,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2022-11-16 11:02:10,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:10,705 INFO L130 PetriNetUnfolder]: 130/525 cut-off events. [2022-11-16 11:02:10,705 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-11-16 11:02:10,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 818 conditions, 525 events. 130/525 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2807 event pairs, 30 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 769. Up to 118 conditions per place. [2022-11-16 11:02:10,715 INFO L137 encePairwiseOnDemand]: 84/93 looper letters, 21 selfloop transitions, 6 changer transitions 45/133 dead transitions. [2022-11-16 11:02:10,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 133 transitions, 416 flow [2022-11-16 11:02:10,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:02:10,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-16 11:02:10,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1074 transitions. [2022-11-16 11:02:10,728 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8248847926267281 [2022-11-16 11:02:10,729 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1074 transitions. [2022-11-16 11:02:10,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1074 transitions. [2022-11-16 11:02:10,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:10,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1074 transitions. [2022-11-16 11:02:10,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 76.71428571428571) internal successors, (1074), 14 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:10,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:10,744 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:10,744 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 182 flow. Second operand 14 states and 1074 transitions. [2022-11-16 11:02:10,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 133 transitions, 416 flow [2022-11-16 11:02:10,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 133 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:02:10,753 INFO L231 Difference]: Finished difference. Result has 115 places, 79 transitions, 205 flow [2022-11-16 11:02:10,754 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=205, PETRI_PLACES=115, PETRI_TRANSITIONS=79} [2022-11-16 11:02:10,754 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 19 predicate places. [2022-11-16 11:02:10,756 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 79 transitions, 205 flow [2022-11-16 11:02:10,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 73.33333333333333) internal successors, (660), 9 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:10,757 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:10,757 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:02:10,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:02:10,759 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 11:02:10,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:10,762 INFO L85 PathProgramCache]: Analyzing trace with hash 894158896, now seen corresponding path program 1 times [2022-11-16 11:02:10,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:10,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910884965] [2022-11-16 11:02:10,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:10,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:11,652 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-16 11:02:11,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:11,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910884965] [2022-11-16 11:02:11,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910884965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:11,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:11,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:02:11,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803262499] [2022-11-16 11:02:11,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:11,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:02:11,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:11,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:02:11,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:02:11,657 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 93 [2022-11-16 11:02:11,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 79 transitions, 205 flow. Second operand has 7 states, 7 states have (on average 67.57142857142857) internal successors, (473), 7 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:11,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:11,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 93 [2022-11-16 11:02:11,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:12,521 INFO L130 PetriNetUnfolder]: 234/554 cut-off events. [2022-11-16 11:02:12,521 INFO L131 PetriNetUnfolder]: For 755/755 co-relation queries the response was YES. [2022-11-16 11:02:12,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 554 events. 234/554 cut-off events. For 755/755 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2525 event pairs, 58 based on Foata normal form. 15/550 useless extension candidates. Maximal degree in co-relation 1396. Up to 240 conditions per place. [2022-11-16 11:02:12,526 INFO L137 encePairwiseOnDemand]: 83/93 looper letters, 31 selfloop transitions, 8 changer transitions 44/137 dead transitions. [2022-11-16 11:02:12,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 137 transitions, 606 flow [2022-11-16 11:02:12,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:02:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:02:12,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 929 transitions. [2022-11-16 11:02:12,530 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7684036393713813 [2022-11-16 11:02:12,530 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 929 transitions. [2022-11-16 11:02:12,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 929 transitions. [2022-11-16 11:02:12,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:12,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 929 transitions. [2022-11-16 11:02:12,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 71.46153846153847) internal successors, (929), 13 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:12,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:12,539 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:12,539 INFO L175 Difference]: Start difference. First operand has 115 places, 79 transitions, 205 flow. Second operand 13 states and 929 transitions. [2022-11-16 11:02:12,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 137 transitions, 606 flow [2022-11-16 11:02:12,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 137 transitions, 552 flow, removed 24 selfloop flow, removed 8 redundant places. [2022-11-16 11:02:12,554 INFO L231 Difference]: Finished difference. Result has 111 places, 85 transitions, 267 flow [2022-11-16 11:02:12,555 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=267, PETRI_PLACES=111, PETRI_TRANSITIONS=85} [2022-11-16 11:02:12,555 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 15 predicate places. [2022-11-16 11:02:12,556 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 85 transitions, 267 flow [2022-11-16 11:02:12,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 67.57142857142857) internal successors, (473), 7 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:12,556 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:12,556 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:02:12,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:02:12,557 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 11:02:12,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:12,558 INFO L85 PathProgramCache]: Analyzing trace with hash -581796440, now seen corresponding path program 1 times [2022-11-16 11:02:12,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:12,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842122933] [2022-11-16 11:02:12,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:12,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:13,231 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-16 11:02:13,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:13,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842122933] [2022-11-16 11:02:13,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842122933] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:13,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:13,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:02:13,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559159632] [2022-11-16 11:02:13,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:13,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:02:13,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:13,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:02:13,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:02:13,235 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 93 [2022-11-16 11:02:13,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 85 transitions, 267 flow. Second operand has 8 states, 8 states have (on average 74.5) internal successors, (596), 8 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:13,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:13,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 93 [2022-11-16 11:02:13,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:13,794 INFO L130 PetriNetUnfolder]: 153/429 cut-off events. [2022-11-16 11:02:13,795 INFO L131 PetriNetUnfolder]: For 1281/1361 co-relation queries the response was YES. [2022-11-16 11:02:13,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1500 conditions, 429 events. 153/429 cut-off events. For 1281/1361 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1905 event pairs, 19 based on Foata normal form. 28/444 useless extension candidates. Maximal degree in co-relation 1435. Up to 187 conditions per place. [2022-11-16 11:02:13,800 INFO L137 encePairwiseOnDemand]: 84/93 looper letters, 24 selfloop transitions, 7 changer transitions 31/127 dead transitions. [2022-11-16 11:02:13,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 127 transitions, 678 flow [2022-11-16 11:02:13,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:02:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:02:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1004 transitions. [2022-11-16 11:02:13,805 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8304383788254756 [2022-11-16 11:02:13,805 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1004 transitions. [2022-11-16 11:02:13,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1004 transitions. [2022-11-16 11:02:13,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:13,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1004 transitions. [2022-11-16 11:02:13,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 77.23076923076923) internal successors, (1004), 13 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:13,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:13,813 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:13,813 INFO L175 Difference]: Start difference. First operand has 111 places, 85 transitions, 267 flow. Second operand 13 states and 1004 transitions. [2022-11-16 11:02:13,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 127 transitions, 678 flow [2022-11-16 11:02:13,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 127 transitions, 630 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-11-16 11:02:13,821 INFO L231 Difference]: Finished difference. Result has 118 places, 88 transitions, 320 flow [2022-11-16 11:02:13,822 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=320, PETRI_PLACES=118, PETRI_TRANSITIONS=88} [2022-11-16 11:02:13,823 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 22 predicate places. [2022-11-16 11:02:13,823 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 88 transitions, 320 flow [2022-11-16 11:02:13,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 74.5) internal successors, (596), 8 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:13,824 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:13,824 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:02:13,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:02:13,825 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 11:02:13,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:13,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1503593732, now seen corresponding path program 2 times [2022-11-16 11:02:13,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:13,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281899360] [2022-11-16 11:02:13,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:13,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:14,625 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-16 11:02:14,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:14,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281899360] [2022-11-16 11:02:14,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281899360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:14,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:14,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 11:02:14,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132582056] [2022-11-16 11:02:14,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:14,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:02:14,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:14,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:02:14,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:02:14,632 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 93 [2022-11-16 11:02:14,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 88 transitions, 320 flow. Second operand has 10 states, 10 states have (on average 72.4) internal successors, (724), 10 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:14,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:14,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 93 [2022-11-16 11:02:14,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:15,210 INFO L130 PetriNetUnfolder]: 143/415 cut-off events. [2022-11-16 11:02:15,211 INFO L131 PetriNetUnfolder]: For 2173/2293 co-relation queries the response was YES. [2022-11-16 11:02:15,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1688 conditions, 415 events. 143/415 cut-off events. For 2173/2293 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1826 event pairs, 20 based on Foata normal form. 33/435 useless extension candidates. Maximal degree in co-relation 1615. Up to 182 conditions per place. [2022-11-16 11:02:15,216 INFO L137 encePairwiseOnDemand]: 83/93 looper letters, 24 selfloop transitions, 10 changer transitions 31/128 dead transitions. [2022-11-16 11:02:15,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 128 transitions, 817 flow [2022-11-16 11:02:15,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:02:15,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-16 11:02:15,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1121 transitions. [2022-11-16 11:02:15,221 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.803584229390681 [2022-11-16 11:02:15,221 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1121 transitions. [2022-11-16 11:02:15,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1121 transitions. [2022-11-16 11:02:15,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:15,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1121 transitions. [2022-11-16 11:02:15,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 74.73333333333333) internal successors, (1121), 15 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:15,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:15,231 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:15,231 INFO L175 Difference]: Start difference. First operand has 118 places, 88 transitions, 320 flow. Second operand 15 states and 1121 transitions. [2022-11-16 11:02:15,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 128 transitions, 817 flow [2022-11-16 11:02:15,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 128 transitions, 676 flow, removed 65 selfloop flow, removed 10 redundant places. [2022-11-16 11:02:15,241 INFO L231 Difference]: Finished difference. Result has 123 places, 90 transitions, 351 flow [2022-11-16 11:02:15,242 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=351, PETRI_PLACES=123, PETRI_TRANSITIONS=90} [2022-11-16 11:02:15,245 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 27 predicate places. [2022-11-16 11:02:15,245 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 90 transitions, 351 flow [2022-11-16 11:02:15,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 72.4) internal successors, (724), 10 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:15,246 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:15,247 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:02:15,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:02:15,247 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 11:02:15,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:15,248 INFO L85 PathProgramCache]: Analyzing trace with hash -743959761, now seen corresponding path program 1 times [2022-11-16 11:02:15,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:15,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69991207] [2022-11-16 11:02:15,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:15,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:15,837 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-16 11:02:15,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:15,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69991207] [2022-11-16 11:02:15,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69991207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:15,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:15,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:02:15,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843249816] [2022-11-16 11:02:15,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:15,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:02:15,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:15,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:02:15,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:02:15,841 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 93 [2022-11-16 11:02:15,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 90 transitions, 351 flow. Second operand has 7 states, 7 states have (on average 67.71428571428571) internal successors, (474), 7 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:15,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:15,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 93 [2022-11-16 11:02:15,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:16,333 INFO L130 PetriNetUnfolder]: 209/601 cut-off events. [2022-11-16 11:02:16,333 INFO L131 PetriNetUnfolder]: For 3693/4097 co-relation queries the response was YES. [2022-11-16 11:02:16,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2599 conditions, 601 events. 209/601 cut-off events. For 3693/4097 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3126 event pairs, 54 based on Foata normal form. 18/598 useless extension candidates. Maximal degree in co-relation 2518. Up to 178 conditions per place. [2022-11-16 11:02:16,340 INFO L137 encePairwiseOnDemand]: 84/93 looper letters, 40 selfloop transitions, 8 changer transitions 28/130 dead transitions. [2022-11-16 11:02:16,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 130 transitions, 925 flow [2022-11-16 11:02:16,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:02:16,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:02:16,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 716 transitions. [2022-11-16 11:02:16,345 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7698924731182796 [2022-11-16 11:02:16,345 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 716 transitions. [2022-11-16 11:02:16,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 716 transitions. [2022-11-16 11:02:16,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:16,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 716 transitions. [2022-11-16 11:02:16,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 71.6) internal successors, (716), 10 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:16,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:16,352 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:16,352 INFO L175 Difference]: Start difference. First operand has 123 places, 90 transitions, 351 flow. Second operand 10 states and 716 transitions. [2022-11-16 11:02:16,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 130 transitions, 925 flow [2022-11-16 11:02:16,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 130 transitions, 799 flow, removed 58 selfloop flow, removed 12 redundant places. [2022-11-16 11:02:16,364 INFO L231 Difference]: Finished difference. Result has 119 places, 93 transitions, 371 flow [2022-11-16 11:02:16,364 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=371, PETRI_PLACES=119, PETRI_TRANSITIONS=93} [2022-11-16 11:02:16,367 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 23 predicate places. [2022-11-16 11:02:16,368 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 93 transitions, 371 flow [2022-11-16 11:02:16,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 67.71428571428571) internal successors, (474), 7 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:16,368 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:16,369 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:02:16,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:02:16,370 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 11:02:16,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:16,371 INFO L85 PathProgramCache]: Analyzing trace with hash -628386102, now seen corresponding path program 1 times [2022-11-16 11:02:16,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:16,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286097844] [2022-11-16 11:02:16,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:16,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:17,574 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-16 11:02:17,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:17,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286097844] [2022-11-16 11:02:17,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286097844] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:17,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:17,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-16 11:02:17,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559347300] [2022-11-16 11:02:17,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:17,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:02:17,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:17,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:02:17,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:02:17,579 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 93 [2022-11-16 11:02:17,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 93 transitions, 371 flow. Second operand has 14 states, 14 states have (on average 67.28571428571429) internal successors, (942), 14 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:17,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:17,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 93 [2022-11-16 11:02:17,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:18,766 INFO L130 PetriNetUnfolder]: 347/905 cut-off events. [2022-11-16 11:02:18,766 INFO L131 PetriNetUnfolder]: For 3331/3587 co-relation queries the response was YES. [2022-11-16 11:02:18,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3090 conditions, 905 events. 347/905 cut-off events. For 3331/3587 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5385 event pairs, 67 based on Foata normal form. 42/934 useless extension candidates. Maximal degree in co-relation 3013. Up to 271 conditions per place. [2022-11-16 11:02:18,776 INFO L137 encePairwiseOnDemand]: 80/93 looper letters, 42 selfloop transitions, 15 changer transitions 42/158 dead transitions. [2022-11-16 11:02:18,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 158 transitions, 924 flow [2022-11-16 11:02:18,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 11:02:18,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-16 11:02:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1478 transitions. [2022-11-16 11:02:18,782 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.756784434203789 [2022-11-16 11:02:18,782 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1478 transitions. [2022-11-16 11:02:18,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1478 transitions. [2022-11-16 11:02:18,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:18,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1478 transitions. [2022-11-16 11:02:18,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 70.38095238095238) internal successors, (1478), 21 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:18,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 93.0) internal successors, (2046), 22 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:18,793 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 93.0) internal successors, (2046), 22 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:18,793 INFO L175 Difference]: Start difference. First operand has 119 places, 93 transitions, 371 flow. Second operand 21 states and 1478 transitions. [2022-11-16 11:02:18,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 158 transitions, 924 flow [2022-11-16 11:02:18,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 158 transitions, 856 flow, removed 30 selfloop flow, removed 7 redundant places. [2022-11-16 11:02:18,802 INFO L231 Difference]: Finished difference. Result has 141 places, 97 transitions, 442 flow [2022-11-16 11:02:18,803 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=442, PETRI_PLACES=141, PETRI_TRANSITIONS=97} [2022-11-16 11:02:18,803 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 45 predicate places. [2022-11-16 11:02:18,803 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 97 transitions, 442 flow [2022-11-16 11:02:18,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 67.28571428571429) internal successors, (942), 14 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:18,804 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:18,805 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:02:18,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:02:18,805 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 11:02:18,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:18,806 INFO L85 PathProgramCache]: Analyzing trace with hash 59046289, now seen corresponding path program 1 times [2022-11-16 11:02:18,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:18,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090365985] [2022-11-16 11:02:18,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:18,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:19,755 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-16 11:02:19,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:19,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090365985] [2022-11-16 11:02:19,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090365985] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:19,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:19,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 11:02:19,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718438296] [2022-11-16 11:02:19,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:19,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 11:02:19,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:19,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 11:02:19,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:02:19,760 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 93 [2022-11-16 11:02:19,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 97 transitions, 442 flow. Second operand has 12 states, 12 states have (on average 70.33333333333333) internal successors, (844), 12 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:19,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:19,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 93 [2022-11-16 11:02:19,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:20,359 INFO L130 PetriNetUnfolder]: 174/579 cut-off events. [2022-11-16 11:02:20,360 INFO L131 PetriNetUnfolder]: For 3566/4035 co-relation queries the response was YES. [2022-11-16 11:02:20,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2445 conditions, 579 events. 174/579 cut-off events. For 3566/4035 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3283 event pairs, 46 based on Foata normal form. 63/622 useless extension candidates. Maximal degree in co-relation 2353. Up to 189 conditions per place. [2022-11-16 11:02:20,367 INFO L137 encePairwiseOnDemand]: 81/93 looper letters, 25 selfloop transitions, 15 changer transitions 31/136 dead transitions. [2022-11-16 11:02:20,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 136 transitions, 927 flow [2022-11-16 11:02:20,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:02:20,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-16 11:02:20,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1018 transitions. [2022-11-16 11:02:20,371 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7818740399385561 [2022-11-16 11:02:20,371 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1018 transitions. [2022-11-16 11:02:20,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1018 transitions. [2022-11-16 11:02:20,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:20,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1018 transitions. [2022-11-16 11:02:20,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 72.71428571428571) internal successors, (1018), 14 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:20,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:20,379 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:20,379 INFO L175 Difference]: Start difference. First operand has 141 places, 97 transitions, 442 flow. Second operand 14 states and 1018 transitions. [2022-11-16 11:02:20,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 136 transitions, 927 flow [2022-11-16 11:02:20,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 136 transitions, 868 flow, removed 21 selfloop flow, removed 14 redundant places. [2022-11-16 11:02:20,391 INFO L231 Difference]: Finished difference. Result has 135 places, 100 transitions, 505 flow [2022-11-16 11:02:20,392 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=505, PETRI_PLACES=135, PETRI_TRANSITIONS=100} [2022-11-16 11:02:20,392 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 39 predicate places. [2022-11-16 11:02:20,393 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 100 transitions, 505 flow [2022-11-16 11:02:20,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 70.33333333333333) internal successors, (844), 12 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:20,393 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:20,394 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:02:20,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:02:20,394 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 11:02:20,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:20,395 INFO L85 PathProgramCache]: Analyzing trace with hash -193471888, now seen corresponding path program 1 times [2022-11-16 11:02:20,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:20,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509593866] [2022-11-16 11:02:20,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:20,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:21,008 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-16 11:02:21,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:21,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509593866] [2022-11-16 11:02:21,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509593866] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:21,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:21,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 11:02:21,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346655293] [2022-11-16 11:02:21,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:21,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 11:02:21,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:21,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 11:02:21,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:02:21,013 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 93 [2022-11-16 11:02:21,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 100 transitions, 505 flow. Second operand has 12 states, 12 states have (on average 68.41666666666667) internal successors, (821), 12 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:21,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:21,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 93 [2022-11-16 11:02:21,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:21,800 INFO L130 PetriNetUnfolder]: 343/941 cut-off events. [2022-11-16 11:02:21,800 INFO L131 PetriNetUnfolder]: For 6777/6916 co-relation queries the response was YES. [2022-11-16 11:02:21,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4095 conditions, 941 events. 343/941 cut-off events. For 6777/6916 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5774 event pairs, 46 based on Foata normal form. 48/969 useless extension candidates. Maximal degree in co-relation 4005. Up to 257 conditions per place. [2022-11-16 11:02:21,811 INFO L137 encePairwiseOnDemand]: 79/93 looper letters, 44 selfloop transitions, 17 changer transitions 44/165 dead transitions. [2022-11-16 11:02:21,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 165 transitions, 1357 flow [2022-11-16 11:02:21,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:02:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-16 11:02:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1022 transitions. [2022-11-16 11:02:21,817 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7849462365591398 [2022-11-16 11:02:21,817 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1022 transitions. [2022-11-16 11:02:21,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1022 transitions. [2022-11-16 11:02:21,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:21,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1022 transitions. [2022-11-16 11:02:21,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 73.0) internal successors, (1022), 14 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:21,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:21,831 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:21,831 INFO L175 Difference]: Start difference. First operand has 135 places, 100 transitions, 505 flow. Second operand 14 states and 1022 transitions. [2022-11-16 11:02:21,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 165 transitions, 1357 flow [2022-11-16 11:02:21,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 165 transitions, 1298 flow, removed 17 selfloop flow, removed 9 redundant places. [2022-11-16 11:02:21,847 INFO L231 Difference]: Finished difference. Result has 140 places, 102 transitions, 543 flow [2022-11-16 11:02:21,848 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=543, PETRI_PLACES=140, PETRI_TRANSITIONS=102} [2022-11-16 11:02:21,849 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 44 predicate places. [2022-11-16 11:02:21,849 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 102 transitions, 543 flow [2022-11-16 11:02:21,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 68.41666666666667) internal successors, (821), 12 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:21,851 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:21,851 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:02:21,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:02:21,852 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 11:02:21,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:21,852 INFO L85 PathProgramCache]: Analyzing trace with hash 728853296, now seen corresponding path program 2 times [2022-11-16 11:02:21,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:21,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097466021] [2022-11-16 11:02:21,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:21,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:22,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:02:22,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:22,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097466021] [2022-11-16 11:02:22,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097466021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:22,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:22,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 11:02:22,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591250651] [2022-11-16 11:02:22,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:22,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:02:22,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:22,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:02:22,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:02:22,788 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 93 [2022-11-16 11:02:22,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 102 transitions, 543 flow. Second operand has 10 states, 10 states have (on average 71.6) internal successors, (716), 10 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:22,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:22,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 93 [2022-11-16 11:02:22,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:23,352 INFO L130 PetriNetUnfolder]: 141/490 cut-off events. [2022-11-16 11:02:23,353 INFO L131 PetriNetUnfolder]: For 4544/4891 co-relation queries the response was YES. [2022-11-16 11:02:23,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2430 conditions, 490 events. 141/490 cut-off events. For 4544/4891 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2519 event pairs, 48 based on Foata normal form. 57/526 useless extension candidates. Maximal degree in co-relation 2338. Up to 203 conditions per place. [2022-11-16 11:02:23,361 INFO L137 encePairwiseOnDemand]: 82/93 looper letters, 26 selfloop transitions, 15 changer transitions 25/132 dead transitions. [2022-11-16 11:02:23,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 132 transitions, 1070 flow [2022-11-16 11:02:23,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:02:23,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-16 11:02:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 889 transitions. [2022-11-16 11:02:23,365 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.796594982078853 [2022-11-16 11:02:23,365 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 889 transitions. [2022-11-16 11:02:23,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 889 transitions. [2022-11-16 11:02:23,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:23,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 889 transitions. [2022-11-16 11:02:23,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 74.08333333333333) internal successors, (889), 12 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:23,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 93.0) internal successors, (1209), 13 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:23,373 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 93.0) internal successors, (1209), 13 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:23,373 INFO L175 Difference]: Start difference. First operand has 140 places, 102 transitions, 543 flow. Second operand 12 states and 889 transitions. [2022-11-16 11:02:23,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 132 transitions, 1070 flow [2022-11-16 11:02:23,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 132 transitions, 987 flow, removed 31 selfloop flow, removed 14 redundant places. [2022-11-16 11:02:23,390 INFO L231 Difference]: Finished difference. Result has 138 places, 105 transitions, 595 flow [2022-11-16 11:02:23,390 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=595, PETRI_PLACES=138, PETRI_TRANSITIONS=105} [2022-11-16 11:02:23,391 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 42 predicate places. [2022-11-16 11:02:23,391 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 105 transitions, 595 flow [2022-11-16 11:02:23,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 71.6) internal successors, (716), 10 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:23,392 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:23,393 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:02:23,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:02:23,393 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 11:02:23,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:23,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1765492742, now seen corresponding path program 3 times [2022-11-16 11:02:23,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:23,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387058713] [2022-11-16 11:02:23,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:23,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:24,156 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-16 11:02:24,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:24,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387058713] [2022-11-16 11:02:24,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387058713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:24,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:24,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 11:02:24,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142084381] [2022-11-16 11:02:24,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:24,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:02:24,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:24,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:02:24,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:02:24,160 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 93 [2022-11-16 11:02:24,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 105 transitions, 595 flow. Second operand has 11 states, 11 states have (on average 72.36363636363636) internal successors, (796), 11 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:24,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:24,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 93 [2022-11-16 11:02:24,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:24,762 INFO L130 PetriNetUnfolder]: 137/509 cut-off events. [2022-11-16 11:02:24,762 INFO L131 PetriNetUnfolder]: For 6447/6914 co-relation queries the response was YES. [2022-11-16 11:02:24,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2750 conditions, 509 events. 137/509 cut-off events. For 6447/6914 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2733 event pairs, 24 based on Foata normal form. 56/544 useless extension candidates. Maximal degree in co-relation 2661. Up to 159 conditions per place. [2022-11-16 11:02:24,770 INFO L137 encePairwiseOnDemand]: 82/93 looper letters, 26 selfloop transitions, 14 changer transitions 39/145 dead transitions. [2022-11-16 11:02:24,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 145 transitions, 1406 flow [2022-11-16 11:02:24,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:02:24,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:02:24,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 974 transitions. [2022-11-16 11:02:24,773 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8056244830438379 [2022-11-16 11:02:24,773 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 974 transitions. [2022-11-16 11:02:24,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 974 transitions. [2022-11-16 11:02:24,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:24,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 974 transitions. [2022-11-16 11:02:24,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 74.92307692307692) internal successors, (974), 13 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:24,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:24,780 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:24,781 INFO L175 Difference]: Start difference. First operand has 138 places, 105 transitions, 595 flow. Second operand 13 states and 974 transitions. [2022-11-16 11:02:24,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 145 transitions, 1406 flow [2022-11-16 11:02:24,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 145 transitions, 1343 flow, removed 19 selfloop flow, removed 7 redundant places. [2022-11-16 11:02:24,803 INFO L231 Difference]: Finished difference. Result has 144 places, 99 transitions, 592 flow [2022-11-16 11:02:24,803 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=592, PETRI_PLACES=144, PETRI_TRANSITIONS=99} [2022-11-16 11:02:24,804 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 48 predicate places. [2022-11-16 11:02:24,804 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 99 transitions, 592 flow [2022-11-16 11:02:24,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 72.36363636363636) internal successors, (796), 11 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:24,805 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:24,805 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:02:24,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:02:24,806 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 11:02:24,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:24,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1821502562, now seen corresponding path program 1 times [2022-11-16 11:02:24,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:24,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690084548] [2022-11-16 11:02:24,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:24,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:02:26,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:26,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690084548] [2022-11-16 11:02:26,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690084548] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:26,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:26,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 11:02:26,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717618074] [2022-11-16 11:02:26,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:26,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 11:02:26,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:26,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 11:02:26,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:02:26,117 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 93 [2022-11-16 11:02:26,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 99 transitions, 592 flow. Second operand has 12 states, 12 states have (on average 65.83333333333333) internal successors, (790), 12 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:26,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:26,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 93 [2022-11-16 11:02:26,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:26,839 INFO L130 PetriNetUnfolder]: 87/380 cut-off events. [2022-11-16 11:02:26,839 INFO L131 PetriNetUnfolder]: For 4630/5606 co-relation queries the response was YES. [2022-11-16 11:02:26,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1981 conditions, 380 events. 87/380 cut-off events. For 4630/5606 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1831 event pairs, 26 based on Foata normal form. 33/395 useless extension candidates. Maximal degree in co-relation 1882. Up to 134 conditions per place. [2022-11-16 11:02:26,845 INFO L137 encePairwiseOnDemand]: 79/93 looper letters, 32 selfloop transitions, 19 changer transitions 23/129 dead transitions. [2022-11-16 11:02:26,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 129 transitions, 1122 flow [2022-11-16 11:02:26,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:02:26,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-16 11:02:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1022 transitions. [2022-11-16 11:02:26,848 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7326164874551971 [2022-11-16 11:02:26,849 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1022 transitions. [2022-11-16 11:02:26,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1022 transitions. [2022-11-16 11:02:26,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:26,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1022 transitions. [2022-11-16 11:02:26,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 68.13333333333334) internal successors, (1022), 15 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:26,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:26,856 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:26,856 INFO L175 Difference]: Start difference. First operand has 144 places, 99 transitions, 592 flow. Second operand 15 states and 1022 transitions. [2022-11-16 11:02:26,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 129 transitions, 1122 flow [2022-11-16 11:02:26,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 129 transitions, 1054 flow, removed 24 selfloop flow, removed 11 redundant places. [2022-11-16 11:02:26,876 INFO L231 Difference]: Finished difference. Result has 149 places, 98 transitions, 614 flow [2022-11-16 11:02:26,877 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=614, PETRI_PLACES=149, PETRI_TRANSITIONS=98} [2022-11-16 11:02:26,878 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 53 predicate places. [2022-11-16 11:02:26,878 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 98 transitions, 614 flow [2022-11-16 11:02:26,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 65.83333333333333) internal successors, (790), 12 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:26,879 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:26,879 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:02:26,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:02:26,880 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 11:02:26,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:26,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1456574658, now seen corresponding path program 2 times [2022-11-16 11:02:26,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:26,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830366298] [2022-11-16 11:02:26,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:26,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:27,991 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-16 11:02:27,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:27,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830366298] [2022-11-16 11:02:27,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830366298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:27,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:27,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-16 11:02:27,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340427526] [2022-11-16 11:02:27,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:27,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 11:02:27,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:27,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 11:02:27,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:02:28,001 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 93 [2022-11-16 11:02:28,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 98 transitions, 614 flow. Second operand has 13 states, 13 states have (on average 69.46153846153847) internal successors, (903), 13 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:28,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:28,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 93 [2022-11-16 11:02:28,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:28,595 INFO L130 PetriNetUnfolder]: 72/353 cut-off events. [2022-11-16 11:02:28,595 INFO L131 PetriNetUnfolder]: For 4965/5636 co-relation queries the response was YES. [2022-11-16 11:02:28,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1873 conditions, 353 events. 72/353 cut-off events. For 4965/5636 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1733 event pairs, 24 based on Foata normal form. 23/357 useless extension candidates. Maximal degree in co-relation 1770. Up to 126 conditions per place. [2022-11-16 11:02:28,601 INFO L137 encePairwiseOnDemand]: 82/93 looper letters, 25 selfloop transitions, 6 changer transitions 16/112 dead transitions. [2022-11-16 11:02:28,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 112 transitions, 971 flow [2022-11-16 11:02:28,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:02:28,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-16 11:02:28,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 991 transitions. [2022-11-16 11:02:28,604 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.761136712749616 [2022-11-16 11:02:28,604 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 991 transitions. [2022-11-16 11:02:28,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 991 transitions. [2022-11-16 11:02:28,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:28,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 991 transitions. [2022-11-16 11:02:28,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 70.78571428571429) internal successors, (991), 14 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:28,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:28,610 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:28,611 INFO L175 Difference]: Start difference. First operand has 149 places, 98 transitions, 614 flow. Second operand 14 states and 991 transitions. [2022-11-16 11:02:28,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 112 transitions, 971 flow [2022-11-16 11:02:28,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 112 transitions, 883 flow, removed 36 selfloop flow, removed 14 redundant places. [2022-11-16 11:02:28,627 INFO L231 Difference]: Finished difference. Result has 146 places, 95 transitions, 566 flow [2022-11-16 11:02:28,628 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=566, PETRI_PLACES=146, PETRI_TRANSITIONS=95} [2022-11-16 11:02:28,629 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 50 predicate places. [2022-11-16 11:02:28,630 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 95 transitions, 566 flow [2022-11-16 11:02:28,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 69.46153846153847) internal successors, (903), 13 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:28,631 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:28,631 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:02:28,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:02:28,631 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 11:02:28,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:28,632 INFO L85 PathProgramCache]: Analyzing trace with hash -256097584, now seen corresponding path program 3 times [2022-11-16 11:02:28,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:28,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708091429] [2022-11-16 11:02:28,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:28,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:02:29,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:29,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708091429] [2022-11-16 11:02:29,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708091429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:29,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:29,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 11:02:29,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624379802] [2022-11-16 11:02:29,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:29,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 11:02:29,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:29,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 11:02:29,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:02:29,943 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 93 [2022-11-16 11:02:29,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 95 transitions, 566 flow. Second operand has 12 states, 12 states have (on average 65.83333333333333) internal successors, (790), 12 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:29,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:29,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 93 [2022-11-16 11:02:29,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:30,657 INFO L130 PetriNetUnfolder]: 80/434 cut-off events. [2022-11-16 11:02:30,657 INFO L131 PetriNetUnfolder]: For 3794/4265 co-relation queries the response was YES. [2022-11-16 11:02:30,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1896 conditions, 434 events. 80/434 cut-off events. For 3794/4265 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2435 event pairs, 7 based on Foata normal form. 32/451 useless extension candidates. Maximal degree in co-relation 1792. Up to 77 conditions per place. [2022-11-16 11:02:30,664 INFO L137 encePairwiseOnDemand]: 79/93 looper letters, 27 selfloop transitions, 16 changer transitions 28/126 dead transitions. [2022-11-16 11:02:30,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 126 transitions, 1167 flow [2022-11-16 11:02:30,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:02:30,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-16 11:02:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1018 transitions. [2022-11-16 11:02:30,671 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7297491039426524 [2022-11-16 11:02:30,671 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1018 transitions. [2022-11-16 11:02:30,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1018 transitions. [2022-11-16 11:02:30,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:30,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1018 transitions. [2022-11-16 11:02:30,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 67.86666666666666) internal successors, (1018), 15 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:30,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:30,693 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:30,698 INFO L175 Difference]: Start difference. First operand has 146 places, 95 transitions, 566 flow. Second operand 15 states and 1018 transitions. [2022-11-16 11:02:30,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 126 transitions, 1167 flow [2022-11-16 11:02:30,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 126 transitions, 1011 flow, removed 69 selfloop flow, removed 16 redundant places. [2022-11-16 11:02:30,715 INFO L231 Difference]: Finished difference. Result has 143 places, 93 transitions, 536 flow [2022-11-16 11:02:30,716 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=536, PETRI_PLACES=143, PETRI_TRANSITIONS=93} [2022-11-16 11:02:30,717 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 47 predicate places. [2022-11-16 11:02:30,717 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 93 transitions, 536 flow [2022-11-16 11:02:30,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 65.83333333333333) internal successors, (790), 12 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:30,719 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:30,719 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:02:30,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:02:30,721 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 11:02:30,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:30,721 INFO L85 PathProgramCache]: Analyzing trace with hash -129836326, now seen corresponding path program 1 times [2022-11-16 11:02:30,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:30,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862896965] [2022-11-16 11:02:30,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:30,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:31,802 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-16 11:02:31,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:31,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862896965] [2022-11-16 11:02:31,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862896965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:31,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:31,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 11:02:31,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756325806] [2022-11-16 11:02:31,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:31,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:02:31,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:31,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:02:31,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:02:31,806 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 93 [2022-11-16 11:02:31,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 93 transitions, 536 flow. Second operand has 9 states, 9 states have (on average 69.77777777777777) internal successors, (628), 9 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:31,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:31,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 93 [2022-11-16 11:02:31,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:32,139 INFO L130 PetriNetUnfolder]: 230/739 cut-off events. [2022-11-16 11:02:32,140 INFO L131 PetriNetUnfolder]: For 6237/6306 co-relation queries the response was YES. [2022-11-16 11:02:32,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2969 conditions, 739 events. 230/739 cut-off events. For 6237/6306 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4571 event pairs, 63 based on Foata normal form. 24/739 useless extension candidates. Maximal degree in co-relation 2872. Up to 260 conditions per place. [2022-11-16 11:02:32,148 INFO L137 encePairwiseOnDemand]: 82/93 looper letters, 38 selfloop transitions, 13 changer transitions 0/110 dead transitions. [2022-11-16 11:02:32,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 110 transitions, 778 flow [2022-11-16 11:02:32,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:02:32,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:02:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 655 transitions. [2022-11-16 11:02:32,151 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7825567502986858 [2022-11-16 11:02:32,151 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 655 transitions. [2022-11-16 11:02:32,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 655 transitions. [2022-11-16 11:02:32,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:32,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 655 transitions. [2022-11-16 11:02:32,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 72.77777777777777) internal successors, (655), 9 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:32,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:32,156 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:32,157 INFO L175 Difference]: Start difference. First operand has 143 places, 93 transitions, 536 flow. Second operand 9 states and 655 transitions. [2022-11-16 11:02:32,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 110 transitions, 778 flow [2022-11-16 11:02:32,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 110 transitions, 639 flow, removed 45 selfloop flow, removed 23 redundant places. [2022-11-16 11:02:32,168 INFO L231 Difference]: Finished difference. Result has 126 places, 96 transitions, 488 flow [2022-11-16 11:02:32,169 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=488, PETRI_PLACES=126, PETRI_TRANSITIONS=96} [2022-11-16 11:02:32,170 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 30 predicate places. [2022-11-16 11:02:32,170 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 96 transitions, 488 flow [2022-11-16 11:02:32,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 69.77777777777777) internal successors, (628), 9 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:32,171 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:32,171 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:02:32,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:02:32,171 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 11:02:32,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:32,172 INFO L85 PathProgramCache]: Analyzing trace with hash 377722650, now seen corresponding path program 2 times [2022-11-16 11:02:32,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:32,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142718294] [2022-11-16 11:02:32,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:32,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:32,385 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-16 11:02:32,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:32,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142718294] [2022-11-16 11:02:32,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142718294] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:32,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:32,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:02:32,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808727316] [2022-11-16 11:02:32,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:32,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:02:32,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:32,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:02:32,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:02:32,391 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2022-11-16 11:02:32,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 96 transitions, 488 flow. Second operand has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:32,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:32,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2022-11-16 11:02:32,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:32,714 INFO L130 PetriNetUnfolder]: 176/551 cut-off events. [2022-11-16 11:02:32,714 INFO L131 PetriNetUnfolder]: For 2685/2760 co-relation queries the response was YES. [2022-11-16 11:02:32,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2017 conditions, 551 events. 176/551 cut-off events. For 2685/2760 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2904 event pairs, 12 based on Foata normal form. 47/594 useless extension candidates. Maximal degree in co-relation 1936. Up to 124 conditions per place. [2022-11-16 11:02:32,720 INFO L137 encePairwiseOnDemand]: 84/93 looper letters, 35 selfloop transitions, 14 changer transitions 28/139 dead transitions. [2022-11-16 11:02:32,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 139 transitions, 1055 flow [2022-11-16 11:02:32,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:02:32,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:02:32,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 778 transitions. [2022-11-16 11:02:32,723 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8365591397849462 [2022-11-16 11:02:32,723 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 778 transitions. [2022-11-16 11:02:32,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 778 transitions. [2022-11-16 11:02:32,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:32,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 778 transitions. [2022-11-16 11:02:32,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 77.8) internal successors, (778), 10 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:32,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:32,729 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:32,729 INFO L175 Difference]: Start difference. First operand has 126 places, 96 transitions, 488 flow. Second operand 10 states and 778 transitions. [2022-11-16 11:02:32,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 139 transitions, 1055 flow [2022-11-16 11:02:32,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 139 transitions, 971 flow, removed 3 selfloop flow, removed 11 redundant places. [2022-11-16 11:02:32,738 INFO L231 Difference]: Finished difference. Result has 128 places, 99 transitions, 471 flow [2022-11-16 11:02:32,738 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=471, PETRI_PLACES=128, PETRI_TRANSITIONS=99} [2022-11-16 11:02:32,739 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 32 predicate places. [2022-11-16 11:02:32,739 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 99 transitions, 471 flow [2022-11-16 11:02:32,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:32,740 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:32,740 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:02:32,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:02:32,740 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 11:02:32,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:32,741 INFO L85 PathProgramCache]: Analyzing trace with hash 493572085, now seen corresponding path program 1 times [2022-11-16 11:02:32,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:32,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708536078] [2022-11-16 11:02:32,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:32,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:32,957 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-16 11:02:32,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:32,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708536078] [2022-11-16 11:02:32,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708536078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:32,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:32,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:02:32,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064532428] [2022-11-16 11:02:32,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:32,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:02:32,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:32,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:02:32,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:02:32,961 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2022-11-16 11:02:32,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 99 transitions, 471 flow. Second operand has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:32,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:32,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2022-11-16 11:02:32,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:33,319 INFO L130 PetriNetUnfolder]: 133/443 cut-off events. [2022-11-16 11:02:33,319 INFO L131 PetriNetUnfolder]: For 2092/2136 co-relation queries the response was YES. [2022-11-16 11:02:33,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1684 conditions, 443 events. 133/443 cut-off events. For 2092/2136 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2378 event pairs, 6 based on Foata normal form. 33/474 useless extension candidates. Maximal degree in co-relation 1606. Up to 80 conditions per place. [2022-11-16 11:02:33,323 INFO L137 encePairwiseOnDemand]: 84/93 looper letters, 15 selfloop transitions, 7 changer transitions 56/138 dead transitions. [2022-11-16 11:02:33,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 138 transitions, 971 flow [2022-11-16 11:02:33,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:02:33,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:02:33,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 989 transitions. [2022-11-16 11:02:33,326 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8180314309346567 [2022-11-16 11:02:33,326 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 989 transitions. [2022-11-16 11:02:33,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 989 transitions. [2022-11-16 11:02:33,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:33,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 989 transitions. [2022-11-16 11:02:33,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 76.07692307692308) internal successors, (989), 13 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:33,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:33,332 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:33,332 INFO L175 Difference]: Start difference. First operand has 128 places, 99 transitions, 471 flow. Second operand 13 states and 989 transitions. [2022-11-16 11:02:33,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 138 transitions, 971 flow [2022-11-16 11:02:33,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 138 transitions, 805 flow, removed 77 selfloop flow, removed 10 redundant places. [2022-11-16 11:02:33,341 INFO L231 Difference]: Finished difference. Result has 136 places, 80 transitions, 287 flow [2022-11-16 11:02:33,341 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=287, PETRI_PLACES=136, PETRI_TRANSITIONS=80} [2022-11-16 11:02:33,342 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 40 predicate places. [2022-11-16 11:02:33,342 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 80 transitions, 287 flow [2022-11-16 11:02:33,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:33,342 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:33,343 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:02:33,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:02:33,343 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 11:02:33,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:33,344 INFO L85 PathProgramCache]: Analyzing trace with hash -518621079, now seen corresponding path program 1 times [2022-11-16 11:02:33,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:33,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621385011] [2022-11-16 11:02:33,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:33,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:02:33,382 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:02:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:02:33,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:02:33,452 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:02:33,454 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-16 11:02:33,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-16 11:02:33,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-16 11:02:33,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-16 11:02:33,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-16 11:02:33,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:02:33,459 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:02:33,467 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:02:33,467 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:02:33,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:02:33 BasicIcfg [2022-11-16 11:02:33,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:02:33,558 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:02:33,558 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:02:33,558 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:02:33,559 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:02:07" (3/4) ... [2022-11-16 11:02:33,561 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 11:02:33,706 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e45b25-e2a6-48c8-ad21-7a9f6e9f93c4/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:02:33,706 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:02:33,708 INFO L158 Benchmark]: Toolchain (without parser) took 28210.76ms. Allocated memory was 115.3MB in the beginning and 388.0MB in the end (delta: 272.6MB). Free memory was 78.1MB in the beginning and 278.4MB in the end (delta: -200.3MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. [2022-11-16 11:02:33,708 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 115.3MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:02:33,709 INFO L158 Benchmark]: CACSL2BoogieTranslator took 780.69ms. Allocated memory is still 115.3MB. Free memory was 77.9MB in the beginning and 79.5MB in the end (delta: -1.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:02:33,709 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.83ms. Allocated memory is still 115.3MB. Free memory was 79.5MB in the beginning and 76.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:02:33,711 INFO L158 Benchmark]: Boogie Preprocessor took 65.68ms. Allocated memory is still 115.3MB. Free memory was 76.9MB in the beginning and 75.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:02:33,711 INFO L158 Benchmark]: RCFGBuilder took 1003.00ms. Allocated memory is still 115.3MB. Free memory was 75.3MB in the beginning and 86.7MB in the end (delta: -11.4MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2022-11-16 11:02:33,714 INFO L158 Benchmark]: TraceAbstraction took 26103.45ms. Allocated memory was 115.3MB in the beginning and 388.0MB in the end (delta: 272.6MB). Free memory was 86.0MB in the beginning and 292.0MB in the end (delta: -206.0MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. [2022-11-16 11:02:33,715 INFO L158 Benchmark]: Witness Printer took 149.00ms. Allocated memory is still 388.0MB. Free memory was 292.0MB in the beginning and 278.4MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 11:02:33,717 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 115.3MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 780.69ms. Allocated memory is still 115.3MB. Free memory was 77.9MB in the beginning and 79.5MB in the end (delta: -1.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.83ms. Allocated memory is still 115.3MB. Free memory was 79.5MB in the beginning and 76.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.68ms. Allocated memory is still 115.3MB. Free memory was 76.9MB in the beginning and 75.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1003.00ms. Allocated memory is still 115.3MB. Free memory was 75.3MB in the beginning and 86.7MB in the end (delta: -11.4MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * TraceAbstraction took 26103.45ms. Allocated memory was 115.3MB in the beginning and 388.0MB in the end (delta: 272.6MB). Free memory was 86.0MB in the beginning and 292.0MB in the end (delta: -206.0MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. * Witness Printer took 149.00ms. Allocated memory is still 388.0MB. Free memory was 292.0MB in the beginning and 278.4MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. 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: [L713] 0 _Bool x$flush_delayed; VAL [x$flush_delayed=0] [L722] 0 int *x$read_delayed_var; VAL [x$flush_delayed=0, x$read_delayed_var={0:0}] [L729] 0 _Bool weak$$choice0; VAL [weak$$choice0=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L730] 0 _Bool weak$$choice2; VAL [weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L714] 0 int x$mem_tmp; VAL [weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$read_delayed_var={0:0}] [L716] 0 _Bool x$r_buff0_thd1; VAL [weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$read_delayed_var={0:0}] [L717] 0 _Bool x$r_buff0_thd2; VAL [weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$read_delayed_var={0:0}] [L715] 0 _Bool x$r_buff0_thd0; VAL [weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$read_delayed_var={0:0}] [L721] 0 _Bool x$read_delayed; VAL [weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L726] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L724] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0_used=0, x$w_buff1_used=0] [L723] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1_used=0] [L725] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L719] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L718] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L720] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] 0 pthread_t t2475; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2475, ((void *)0), P0, ((void *)0))=-1, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t2476; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2476, ((void *)0), P1, ((void *)0))=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 __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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, 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, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, 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, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=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: 791]: 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: 793]: 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 5 procedures, 111 locations, 5 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: 25.8s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1072 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1072 mSDsluCounter, 1105 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 900 mSDsCounter, 202 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2263 IncrementalHoareTripleChecker+Invalid, 2465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 202 mSolverCounterUnsat, 205 mSDtfsCounter, 2263 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=614occurred in iteration=12, InterpolantAutomatonStates: 218, 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, 13.6s InterpolantComputationTime, 1182 NumberOfCodeBlocks, 1182 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1093 ConstructedInterpolants, 0 QuantifiedInterpolants, 7287 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-16 11:02:33,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e45b25-e2a6-48c8-ad21-7a9f6e9f93c4/bin/uautomizer-tPACEb0tL8/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