./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d1d8464-0fbf-458c-9c7d-00cb6ad496df/bin/uautomizer-J5u9QxTXDZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d1d8464-0fbf-458c-9c7d-00cb6ad496df/bin/uautomizer-J5u9QxTXDZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d1d8464-0fbf-458c-9c7d-00cb6ad496df/bin/uautomizer-J5u9QxTXDZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d1d8464-0fbf-458c-9c7d-00cb6ad496df/bin/uautomizer-J5u9QxTXDZ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d1d8464-0fbf-458c-9c7d-00cb6ad496df/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d1d8464-0fbf-458c-9c7d-00cb6ad496df/bin/uautomizer-J5u9QxTXDZ --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 b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 --- 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-dbf71c6-m [2022-10-17 10:48:10,580 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 10:48:10,586 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 10:48:10,641 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 10:48:10,642 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 10:48:10,646 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 10:48:10,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 10:48:10,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 10:48:10,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 10:48:10,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 10:48:10,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 10:48:10,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 10:48:10,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 10:48:10,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 10:48:10,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 10:48:10,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 10:48:10,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 10:48:10,679 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 10:48:10,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 10:48:10,685 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 10:48:10,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 10:48:10,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 10:48:10,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 10:48:10,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 10:48:10,696 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 10:48:10,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 10:48:10,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 10:48:10,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 10:48:10,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 10:48:10,701 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 10:48:10,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 10:48:10,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 10:48:10,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 10:48:10,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 10:48:10,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 10:48:10,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 10:48:10,707 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 10:48:10,708 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 10:48:10,708 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 10:48:10,709 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 10:48:10,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 10:48:10,711 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d1d8464-0fbf-458c-9c7d-00cb6ad496df/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-10-17 10:48:10,753 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 10:48:10,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 10:48:10,755 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 10:48:10,755 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 10:48:10,756 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 10:48:10,756 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 10:48:10,757 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 10:48:10,757 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 10:48:10,757 INFO L138 SettingsManager]: * Use SBE=true [2022-10-17 10:48:10,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 10:48:10,758 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 10:48:10,759 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 10:48:10,759 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 10:48:10,759 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 10:48:10,759 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 10:48:10,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 10:48:10,760 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 10:48:10,760 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 10:48:10,760 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 10:48:10,760 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 10:48:10,760 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 10:48:10,761 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 10:48:10,761 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-17 10:48:10,761 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 10:48:10,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:48:10,762 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 10:48:10,762 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 10:48:10,762 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 10:48:10,762 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-17 10:48:10,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 10:48:10,763 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-17 10:48:10,763 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-10-17 10:48:10,763 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 10:48:10,763 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_7d1d8464-0fbf-458c-9c7d-00cb6ad496df/bin/uautomizer-J5u9QxTXDZ/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_7d1d8464-0fbf-458c-9c7d-00cb6ad496df/bin/uautomizer-J5u9QxTXDZ 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 -> b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 [2022-10-17 10:48:11,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 10:48:11,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 10:48:11,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 10:48:11,127 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 10:48:11,128 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 10:48:11,130 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d1d8464-0fbf-458c-9c7d-00cb6ad496df/bin/uautomizer-J5u9QxTXDZ/../../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-10-17 10:48:11,210 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d1d8464-0fbf-458c-9c7d-00cb6ad496df/bin/uautomizer-J5u9QxTXDZ/data/84055aad2/f8134abf58e4413196abd906531c55b4/FLAG8aa3de53d [2022-10-17 10:48:11,821 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 10:48:11,830 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d1d8464-0fbf-458c-9c7d-00cb6ad496df/sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-10-17 10:48:11,860 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d1d8464-0fbf-458c-9c7d-00cb6ad496df/bin/uautomizer-J5u9QxTXDZ/data/84055aad2/f8134abf58e4413196abd906531c55b4/FLAG8aa3de53d [2022-10-17 10:48:12,104 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d1d8464-0fbf-458c-9c7d-00cb6ad496df/bin/uautomizer-J5u9QxTXDZ/data/84055aad2/f8134abf58e4413196abd906531c55b4 [2022-10-17 10:48:12,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 10:48:12,112 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 10:48:12,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 10:48:12,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 10:48:12,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 10:48:12,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:48:12" (1/1) ... [2022-10-17 10:48:12,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7472cae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:48:12, skipping insertion in model container [2022-10-17 10:48:12,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:48:12" (1/1) ... [2022-10-17 10:48:12,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 10:48:12,215 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 10:48:12,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d1d8464-0fbf-458c-9c7d-00cb6ad496df/sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-10-17 10:48:12,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:48:12,717 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 10:48:12,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d1d8464-0fbf-458c-9c7d-00cb6ad496df/sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-10-17 10:48:12,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:48:12,882 INFO L208 MainTranslator]: Completed translation [2022-10-17 10:48:12,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:48:12 WrapperNode [2022-10-17 10:48:12,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 10:48:12,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 10:48:12,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 10:48:12,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 10:48:12,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:48:12" (1/1) ... [2022-10-17 10:48:12,935 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:48:12" (1/1) ... [2022-10-17 10:48:12,984 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 273 [2022-10-17 10:48:12,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 10:48:12,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 10:48:12,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 10:48:12,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 10:48:12,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:48:12" (1/1) ... [2022-10-17 10:48:12,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:48:12" (1/1) ... [2022-10-17 10:48:13,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:48:12" (1/1) ... [2022-10-17 10:48:13,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:48:12" (1/1) ... [2022-10-17 10:48:13,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:48:12" (1/1) ... [2022-10-17 10:48:13,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:48:12" (1/1) ... [2022-10-17 10:48:13,051 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:48:12" (1/1) ... [2022-10-17 10:48:13,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:48:12" (1/1) ... [2022-10-17 10:48:13,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 10:48:13,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 10:48:13,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 10:48:13,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 10:48:13,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:48:12" (1/1) ... [2022-10-17 10:48:13,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:48:13,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d1d8464-0fbf-458c-9c7d-00cb6ad496df/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:48:13,123 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d1d8464-0fbf-458c-9c7d-00cb6ad496df/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 10:48:13,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d1d8464-0fbf-458c-9c7d-00cb6ad496df/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 10:48:13,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-17 10:48:13,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-10-17 10:48:13,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 10:48:13,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-17 10:48:13,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-17 10:48:13,171 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-10-17 10:48:13,171 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-10-17 10:48:13,171 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-10-17 10:48:13,172 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-10-17 10:48:13,173 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-10-17 10:48:13,173 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-10-17 10:48:13,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 10:48:13,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-10-17 10:48:13,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 10:48:13,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 10:48:13,176 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-17 10:48:13,405 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 10:48:13,407 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 10:48:14,219 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 10:48:14,727 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 10:48:14,727 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-17 10:48:14,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:48:14 BoogieIcfgContainer [2022-10-17 10:48:14,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 10:48:14,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 10:48:14,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 10:48:14,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 10:48:14,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 10:48:12" (1/3) ... [2022-10-17 10:48:14,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f6eb90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:48:14, skipping insertion in model container [2022-10-17 10:48:14,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:48:12" (2/3) ... [2022-10-17 10:48:14,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f6eb90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:48:14, skipping insertion in model container [2022-10-17 10:48:14,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:48:14" (3/3) ... [2022-10-17 10:48:14,739 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-10-17 10:48:14,749 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-17 10:48:14,760 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 10:48:14,760 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-17 10:48:14,760 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-17 10:48:14,852 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-10-17 10:48:14,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-10-17 10:48:14,994 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-10-17 10:48:14,994 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-10-17 10:48:14,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-10-17 10:48:14,999 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-10-17 10:48:15,004 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-10-17 10:48:15,022 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 10:48:15,029 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;@2bb93034, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 10:48:15,030 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-10-17 10:48:15,041 INFO L130 PetriNetUnfolder]: 0/44 cut-off events. [2022-10-17 10:48:15,042 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-10-17 10:48:15,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:48:15,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:48:15,043 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:48:15,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:48:15,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1234575711, now seen corresponding path program 1 times [2022-10-17 10:48:15,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:48:15,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368263049] [2022-10-17 10:48:15,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:48:15,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:48:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:48:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:48:15,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:48:15,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368263049] [2022-10-17 10:48:15,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368263049] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:48:15,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:48:15,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:48:15,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128585437] [2022-10-17 10:48:15,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:48:15,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:48:15,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:48:15,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:48:15,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:48:15,646 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 112 [2022-10-17 10:48:15,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:15,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:48:15,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 112 [2022-10-17 10:48:15,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:48:15,963 INFO L130 PetriNetUnfolder]: 58/484 cut-off events. [2022-10-17 10:48:15,963 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-10-17 10:48:15,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 484 events. 58/484 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2501 event pairs, 44 based on Foata normal form. 15/466 useless extension candidates. Maximal degree in co-relation 563. Up to 79 conditions per place. [2022-10-17 10:48:15,973 INFO L137 encePairwiseOnDemand]: 107/112 looper letters, 14 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2022-10-17 10:48:15,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 111 transitions, 269 flow [2022-10-17 10:48:15,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:48:15,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-10-17 10:48:15,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2022-10-17 10:48:15,995 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9375 [2022-10-17 10:48:15,996 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2022-10-17 10:48:15,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2022-10-17 10:48:16,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:48:16,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2022-10-17 10:48:16,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:16,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:16,021 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:16,023 INFO L175 Difference]: Start difference. First operand has 117 places, 109 transitions, 227 flow. Second operand 3 states and 315 transitions. [2022-10-17 10:48:16,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 111 transitions, 269 flow [2022-10-17 10:48:16,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 264 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-10-17 10:48:16,034 INFO L231 Difference]: Finished difference. Result has 114 places, 105 transitions, 220 flow [2022-10-17 10:48:16,036 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=114, PETRI_TRANSITIONS=105} [2022-10-17 10:48:16,040 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, -3 predicate places. [2022-10-17 10:48:16,041 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 220 flow [2022-10-17 10:48:16,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:16,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:48:16,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:48:16,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 10:48:16,043 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:48:16,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:48:16,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1218056957, now seen corresponding path program 1 times [2022-10-17 10:48:16,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:48:16,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771437712] [2022-10-17 10:48:16,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:48:16,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:48:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:48:16,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:48:16,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:48:16,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771437712] [2022-10-17 10:48:16,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771437712] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:48:16,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:48:16,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:48:16,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176771949] [2022-10-17 10:48:16,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:48:16,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:48:16,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:48:16,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:48:16,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:48:16,669 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-10-17 10:48:16,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 105 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:16,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:48:16,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-10-17 10:48:16,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:48:17,627 INFO L130 PetriNetUnfolder]: 834/2274 cut-off events. [2022-10-17 10:48:17,628 INFO L131 PetriNetUnfolder]: For 103/103 co-relation queries the response was YES. [2022-10-17 10:48:17,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3699 conditions, 2274 events. 834/2274 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 17106 event pairs, 193 based on Foata normal form. 0/2201 useless extension candidates. Maximal degree in co-relation 3649. Up to 732 conditions per place. [2022-10-17 10:48:17,648 INFO L137 encePairwiseOnDemand]: 105/112 looper letters, 23 selfloop transitions, 3 changer transitions 57/158 dead transitions. [2022-10-17 10:48:17,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 158 transitions, 488 flow [2022-10-17 10:48:17,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 10:48:17,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-10-17 10:48:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 875 transitions. [2022-10-17 10:48:17,654 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8680555555555556 [2022-10-17 10:48:17,654 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 875 transitions. [2022-10-17 10:48:17,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 875 transitions. [2022-10-17 10:48:17,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:48:17,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 875 transitions. [2022-10-17 10:48:17,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.22222222222223) internal successors, (875), 9 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:17,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:17,665 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:17,666 INFO L175 Difference]: Start difference. First operand has 114 places, 105 transitions, 220 flow. Second operand 9 states and 875 transitions. [2022-10-17 10:48:17,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 158 transitions, 488 flow [2022-10-17 10:48:17,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 158 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-10-17 10:48:17,674 INFO L231 Difference]: Finished difference. Result has 127 places, 95 transitions, 235 flow [2022-10-17 10:48:17,675 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=235, PETRI_PLACES=127, PETRI_TRANSITIONS=95} [2022-10-17 10:48:17,676 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 10 predicate places. [2022-10-17 10:48:17,676 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 95 transitions, 235 flow [2022-10-17 10:48:17,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:17,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:48:17,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:48:17,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 10:48:17,678 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:48:17,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:48:17,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2123130946, now seen corresponding path program 1 times [2022-10-17 10:48:17,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:48:17,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74883006] [2022-10-17 10:48:17,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:48:17,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:48:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:48:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:48:18,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:48:18,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74883006] [2022-10-17 10:48:18,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74883006] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:48:18,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:48:18,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-17 10:48:18,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470027899] [2022-10-17 10:48:18,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:48:18,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-17 10:48:18,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:48:18,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-17 10:48:18,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-10-17 10:48:18,804 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-10-17 10:48:18,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 95 transitions, 235 flow. Second operand has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:18,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:48:18,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-10-17 10:48:18,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:48:19,559 INFO L130 PetriNetUnfolder]: 477/1078 cut-off events. [2022-10-17 10:48:19,560 INFO L131 PetriNetUnfolder]: For 760/763 co-relation queries the response was YES. [2022-10-17 10:48:19,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2433 conditions, 1078 events. 477/1078 cut-off events. For 760/763 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6383 event pairs, 129 based on Foata normal form. 30/1075 useless extension candidates. Maximal degree in co-relation 2373. Up to 418 conditions per place. [2022-10-17 10:48:19,573 INFO L137 encePairwiseOnDemand]: 100/112 looper letters, 21 selfloop transitions, 10 changer transitions 44/151 dead transitions. [2022-10-17 10:48:19,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 151 transitions, 533 flow [2022-10-17 10:48:19,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-17 10:48:19,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-10-17 10:48:19,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1398 transitions. [2022-10-17 10:48:19,580 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8321428571428572 [2022-10-17 10:48:19,580 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1398 transitions. [2022-10-17 10:48:19,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1398 transitions. [2022-10-17 10:48:19,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:48:19,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1398 transitions. [2022-10-17 10:48:19,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 93.2) internal successors, (1398), 15 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:19,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:19,594 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:19,594 INFO L175 Difference]: Start difference. First operand has 127 places, 95 transitions, 235 flow. Second operand 15 states and 1398 transitions. [2022-10-17 10:48:19,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 151 transitions, 533 flow [2022-10-17 10:48:19,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 151 transitions, 512 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-10-17 10:48:19,609 INFO L231 Difference]: Finished difference. Result has 130 places, 101 transitions, 310 flow [2022-10-17 10:48:19,609 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=310, PETRI_PLACES=130, PETRI_TRANSITIONS=101} [2022-10-17 10:48:19,612 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 13 predicate places. [2022-10-17 10:48:19,612 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 101 transitions, 310 flow [2022-10-17 10:48:19,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:19,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:48:19,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:48:19,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-17 10:48:19,614 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:48:19,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:48:19,615 INFO L85 PathProgramCache]: Analyzing trace with hash -271884843, now seen corresponding path program 1 times [2022-10-17 10:48:19,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:48:19,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124639410] [2022-10-17 10:48:19,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:48:19,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:48:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:48:20,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:48:20,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:48:20,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124639410] [2022-10-17 10:48:20,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124639410] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:48:20,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:48:20,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:48:20,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072093729] [2022-10-17 10:48:20,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:48:20,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:48:20,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:48:20,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:48:20,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:48:20,029 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2022-10-17 10:48:20,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 101 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:20,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:48:20,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2022-10-17 10:48:20,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:48:20,562 INFO L130 PetriNetUnfolder]: 387/912 cut-off events. [2022-10-17 10:48:20,562 INFO L131 PetriNetUnfolder]: For 2459/2477 co-relation queries the response was YES. [2022-10-17 10:48:20,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2923 conditions, 912 events. 387/912 cut-off events. For 2459/2477 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5129 event pairs, 117 based on Foata normal form. 20/876 useless extension candidates. Maximal degree in co-relation 2853. Up to 397 conditions per place. [2022-10-17 10:48:20,577 INFO L137 encePairwiseOnDemand]: 106/112 looper letters, 26 selfloop transitions, 2 changer transitions 31/140 dead transitions. [2022-10-17 10:48:20,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 140 transitions, 683 flow [2022-10-17 10:48:20,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 10:48:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-10-17 10:48:20,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 872 transitions. [2022-10-17 10:48:20,582 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8650793650793651 [2022-10-17 10:48:20,582 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 872 transitions. [2022-10-17 10:48:20,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 872 transitions. [2022-10-17 10:48:20,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:48:20,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 872 transitions. [2022-10-17 10:48:20,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.88888888888889) internal successors, (872), 9 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:20,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:20,595 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:20,595 INFO L175 Difference]: Start difference. First operand has 130 places, 101 transitions, 310 flow. Second operand 9 states and 872 transitions. [2022-10-17 10:48:20,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 140 transitions, 683 flow [2022-10-17 10:48:20,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 140 transitions, 665 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-10-17 10:48:20,611 INFO L231 Difference]: Finished difference. Result has 131 places, 101 transitions, 320 flow [2022-10-17 10:48:20,612 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=320, PETRI_PLACES=131, PETRI_TRANSITIONS=101} [2022-10-17 10:48:20,616 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 14 predicate places. [2022-10-17 10:48:20,616 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 101 transitions, 320 flow [2022-10-17 10:48:20,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:20,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:48:20,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:48:20,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-17 10:48:20,620 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:48:20,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:48:20,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1908378922, now seen corresponding path program 1 times [2022-10-17 10:48:20,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:48:20,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078479056] [2022-10-17 10:48:20,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:48:20,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:48:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:48:22,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:48:22,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:48:22,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078479056] [2022-10-17 10:48:22,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078479056] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:48:22,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:48:22,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-10-17 10:48:22,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312845080] [2022-10-17 10:48:22,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:48:22,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-17 10:48:22,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:48:22,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-17 10:48:22,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-10-17 10:48:22,366 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 112 [2022-10-17 10:48:22,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 101 transitions, 320 flow. Second operand has 14 states, 14 states have (on average 86.28571428571429) internal successors, (1208), 14 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:22,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:48:22,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 112 [2022-10-17 10:48:22,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:48:23,057 INFO L130 PetriNetUnfolder]: 314/782 cut-off events. [2022-10-17 10:48:23,057 INFO L131 PetriNetUnfolder]: For 2608/2622 co-relation queries the response was YES. [2022-10-17 10:48:23,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2633 conditions, 782 events. 314/782 cut-off events. For 2608/2622 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4125 event pairs, 100 based on Foata normal form. 23/772 useless extension candidates. Maximal degree in co-relation 2553. Up to 360 conditions per place. [2022-10-17 10:48:23,070 INFO L137 encePairwiseOnDemand]: 98/112 looper letters, 23 selfloop transitions, 15 changer transitions 35/146 dead transitions. [2022-10-17 10:48:23,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 146 transitions, 774 flow [2022-10-17 10:48:23,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-17 10:48:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-10-17 10:48:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1687 transitions. [2022-10-17 10:48:23,077 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7927631578947368 [2022-10-17 10:48:23,078 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1687 transitions. [2022-10-17 10:48:23,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1687 transitions. [2022-10-17 10:48:23,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:48:23,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1687 transitions. [2022-10-17 10:48:23,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 88.78947368421052) internal successors, (1687), 19 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:23,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 112.0) internal successors, (2240), 20 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:23,093 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 112.0) internal successors, (2240), 20 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:23,093 INFO L175 Difference]: Start difference. First operand has 131 places, 101 transitions, 320 flow. Second operand 19 states and 1687 transitions. [2022-10-17 10:48:23,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 146 transitions, 774 flow [2022-10-17 10:48:23,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 146 transitions, 734 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-10-17 10:48:23,106 INFO L231 Difference]: Finished difference. Result has 146 places, 105 transitions, 413 flow [2022-10-17 10:48:23,106 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=413, PETRI_PLACES=146, PETRI_TRANSITIONS=105} [2022-10-17 10:48:23,109 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 29 predicate places. [2022-10-17 10:48:23,109 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 105 transitions, 413 flow [2022-10-17 10:48:23,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 86.28571428571429) internal successors, (1208), 14 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:23,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:48:23,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:48:23,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-17 10:48:23,111 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:48:23,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:48:23,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1734892530, now seen corresponding path program 1 times [2022-10-17 10:48:23,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:48:23,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93761088] [2022-10-17 10:48:23,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:48:23,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:48:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:48:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:48:23,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:48:23,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93761088] [2022-10-17 10:48:23,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93761088] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:48:23,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:48:23,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-17 10:48:23,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942074315] [2022-10-17 10:48:23,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:48:23,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-17 10:48:23,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:48:23,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-17 10:48:23,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-17 10:48:23,525 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-10-17 10:48:23,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 105 transitions, 413 flow. Second operand has 8 states, 8 states have (on average 90.75) internal successors, (726), 8 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:23,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:48:23,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-10-17 10:48:23,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:48:24,070 INFO L130 PetriNetUnfolder]: 355/844 cut-off events. [2022-10-17 10:48:24,070 INFO L131 PetriNetUnfolder]: For 5685/5699 co-relation queries the response was YES. [2022-10-17 10:48:24,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3491 conditions, 844 events. 355/844 cut-off events. For 5685/5699 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4360 event pairs, 99 based on Foata normal form. 20/828 useless extension candidates. Maximal degree in co-relation 3404. Up to 328 conditions per place. [2022-10-17 10:48:24,087 INFO L137 encePairwiseOnDemand]: 101/112 looper letters, 31 selfloop transitions, 11 changer transitions 25/144 dead transitions. [2022-10-17 10:48:24,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 144 transitions, 865 flow [2022-10-17 10:48:24,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-17 10:48:24,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-10-17 10:48:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1039 transitions. [2022-10-17 10:48:24,092 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8433441558441559 [2022-10-17 10:48:24,093 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1039 transitions. [2022-10-17 10:48:24,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1039 transitions. [2022-10-17 10:48:24,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:48:24,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1039 transitions. [2022-10-17 10:48:24,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.45454545454545) internal successors, (1039), 11 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:24,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:24,101 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:24,102 INFO L175 Difference]: Start difference. First operand has 146 places, 105 transitions, 413 flow. Second operand 11 states and 1039 transitions. [2022-10-17 10:48:24,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 144 transitions, 865 flow [2022-10-17 10:48:24,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 144 transitions, 727 flow, removed 63 selfloop flow, removed 15 redundant places. [2022-10-17 10:48:24,119 INFO L231 Difference]: Finished difference. Result has 139 places, 109 transitions, 427 flow [2022-10-17 10:48:24,119 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=427, PETRI_PLACES=139, PETRI_TRANSITIONS=109} [2022-10-17 10:48:24,123 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 22 predicate places. [2022-10-17 10:48:24,123 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 109 transitions, 427 flow [2022-10-17 10:48:24,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.75) internal successors, (726), 8 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:24,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:48:24,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:48:24,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-17 10:48:24,124 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:48:24,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:48:24,125 INFO L85 PathProgramCache]: Analyzing trace with hash 863196512, now seen corresponding path program 2 times [2022-10-17 10:48:24,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:48:24,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159274654] [2022-10-17 10:48:24,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:48:24,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:48:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:48:24,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:48:24,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:48:24,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159274654] [2022-10-17 10:48:24,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159274654] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:48:24,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:48:24,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:48:24,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102451777] [2022-10-17 10:48:24,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:48:24,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:48:24,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:48:24,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:48:24,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:48:24,420 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-10-17 10:48:24,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 109 transitions, 427 flow. Second operand has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:24,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:48:24,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-10-17 10:48:24,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:48:25,104 INFO L130 PetriNetUnfolder]: 630/1357 cut-off events. [2022-10-17 10:48:25,105 INFO L131 PetriNetUnfolder]: For 6257/7425 co-relation queries the response was YES. [2022-10-17 10:48:25,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5486 conditions, 1357 events. 630/1357 cut-off events. For 6257/7425 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7976 event pairs, 72 based on Foata normal form. 37/1315 useless extension candidates. Maximal degree in co-relation 5405. Up to 463 conditions per place. [2022-10-17 10:48:25,126 INFO L137 encePairwiseOnDemand]: 103/112 looper letters, 40 selfloop transitions, 5 changer transitions 35/158 dead transitions. [2022-10-17 10:48:25,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 158 transitions, 1006 flow [2022-10-17 10:48:25,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 10:48:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-10-17 10:48:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 673 transitions. [2022-10-17 10:48:25,130 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8584183673469388 [2022-10-17 10:48:25,131 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 673 transitions. [2022-10-17 10:48:25,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 673 transitions. [2022-10-17 10:48:25,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:48:25,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 673 transitions. [2022-10-17 10:48:25,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:25,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:25,137 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:25,137 INFO L175 Difference]: Start difference. First operand has 139 places, 109 transitions, 427 flow. Second operand 7 states and 673 transitions. [2022-10-17 10:48:25,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 158 transitions, 1006 flow [2022-10-17 10:48:25,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 158 transitions, 935 flow, removed 27 selfloop flow, removed 8 redundant places. [2022-10-17 10:48:25,158 INFO L231 Difference]: Finished difference. Result has 135 places, 109 transitions, 419 flow [2022-10-17 10:48:25,159 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=419, PETRI_PLACES=135, PETRI_TRANSITIONS=109} [2022-10-17 10:48:25,159 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 18 predicate places. [2022-10-17 10:48:25,160 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 109 transitions, 419 flow [2022-10-17 10:48:25,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:25,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:48:25,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:48:25,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-17 10:48:25,161 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:48:25,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:48:25,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1674736738, now seen corresponding path program 3 times [2022-10-17 10:48:25,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:48:25,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435134902] [2022-10-17 10:48:25,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:48:25,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:48:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:48:25,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:48:25,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:48:25,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435134902] [2022-10-17 10:48:25,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435134902] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:48:25,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:48:25,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-17 10:48:25,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419111245] [2022-10-17 10:48:25,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:48:25,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-17 10:48:25,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:48:25,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-17 10:48:25,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-10-17 10:48:25,836 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-10-17 10:48:25,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 109 transitions, 419 flow. Second operand has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:25,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:48:25,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-10-17 10:48:25,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:48:26,442 INFO L130 PetriNetUnfolder]: 302/765 cut-off events. [2022-10-17 10:48:26,442 INFO L131 PetriNetUnfolder]: For 3013/3199 co-relation queries the response was YES. [2022-10-17 10:48:26,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2821 conditions, 765 events. 302/765 cut-off events. For 3013/3199 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3818 event pairs, 113 based on Foata normal form. 18/741 useless extension candidates. Maximal degree in co-relation 2738. Up to 293 conditions per place. [2022-10-17 10:48:26,455 INFO L137 encePairwiseOnDemand]: 103/112 looper letters, 30 selfloop transitions, 9 changer transitions 25/140 dead transitions. [2022-10-17 10:48:26,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 140 transitions, 770 flow [2022-10-17 10:48:26,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-17 10:48:26,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-10-17 10:48:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1111 transitions. [2022-10-17 10:48:26,460 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8266369047619048 [2022-10-17 10:48:26,460 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1111 transitions. [2022-10-17 10:48:26,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1111 transitions. [2022-10-17 10:48:26,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:48:26,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1111 transitions. [2022-10-17 10:48:26,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 92.58333333333333) internal successors, (1111), 12 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:26,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:26,470 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:26,470 INFO L175 Difference]: Start difference. First operand has 135 places, 109 transitions, 419 flow. Second operand 12 states and 1111 transitions. [2022-10-17 10:48:26,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 140 transitions, 770 flow [2022-10-17 10:48:26,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 140 transitions, 734 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-10-17 10:48:26,481 INFO L231 Difference]: Finished difference. Result has 144 places, 109 transitions, 435 flow [2022-10-17 10:48:26,482 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=435, PETRI_PLACES=144, PETRI_TRANSITIONS=109} [2022-10-17 10:48:26,484 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 27 predicate places. [2022-10-17 10:48:26,484 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 109 transitions, 435 flow [2022-10-17 10:48:26,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:26,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:48:26,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:48:26,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-17 10:48:26,487 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:48:26,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:48:26,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1531004485, now seen corresponding path program 1 times [2022-10-17 10:48:26,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:48:26,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056187251] [2022-10-17 10:48:26,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:48:26,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:48:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:48:26,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:48:26,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:48:26,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056187251] [2022-10-17 10:48:26,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056187251] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:48:26,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:48:26,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:48:26,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932533288] [2022-10-17 10:48:26,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:48:26,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:48:26,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:48:26,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:48:26,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:48:26,785 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-10-17 10:48:26,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 109 transitions, 435 flow. Second operand has 7 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:26,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:48:26,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-10-17 10:48:26,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:48:27,694 INFO L130 PetriNetUnfolder]: 632/1494 cut-off events. [2022-10-17 10:48:27,695 INFO L131 PetriNetUnfolder]: For 6452/7001 co-relation queries the response was YES. [2022-10-17 10:48:27,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5656 conditions, 1494 events. 632/1494 cut-off events. For 6452/7001 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9378 event pairs, 123 based on Foata normal form. 41/1443 useless extension candidates. Maximal degree in co-relation 5571. Up to 497 conditions per place. [2022-10-17 10:48:27,715 INFO L137 encePairwiseOnDemand]: 105/112 looper letters, 39 selfloop transitions, 3 changer transitions 60/180 dead transitions. [2022-10-17 10:48:27,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 180 transitions, 1197 flow [2022-10-17 10:48:27,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-17 10:48:27,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-10-17 10:48:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1317 transitions. [2022-10-17 10:48:27,720 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8399234693877551 [2022-10-17 10:48:27,721 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1317 transitions. [2022-10-17 10:48:27,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1317 transitions. [2022-10-17 10:48:27,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:48:27,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1317 transitions. [2022-10-17 10:48:27,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 94.07142857142857) internal successors, (1317), 14 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:27,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:27,733 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:27,734 INFO L175 Difference]: Start difference. First operand has 144 places, 109 transitions, 435 flow. Second operand 14 states and 1317 transitions. [2022-10-17 10:48:27,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 180 transitions, 1197 flow [2022-10-17 10:48:27,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 180 transitions, 1093 flow, removed 45 selfloop flow, removed 13 redundant places. [2022-10-17 10:48:27,757 INFO L231 Difference]: Finished difference. Result has 150 places, 109 transitions, 428 flow [2022-10-17 10:48:27,757 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=428, PETRI_PLACES=150, PETRI_TRANSITIONS=109} [2022-10-17 10:48:27,758 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 33 predicate places. [2022-10-17 10:48:27,758 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 109 transitions, 428 flow [2022-10-17 10:48:27,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:27,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:48:27,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:48:27,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-17 10:48:27,760 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:48:27,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:48:27,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1700060686, now seen corresponding path program 1 times [2022-10-17 10:48:27,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:48:27,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976000367] [2022-10-17 10:48:27,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:48:27,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:48:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:48:28,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:48:28,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:48:28,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976000367] [2022-10-17 10:48:28,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976000367] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:48:28,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:48:28,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-17 10:48:28,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146582017] [2022-10-17 10:48:28,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:48:28,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-17 10:48:28,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:48:28,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-17 10:48:28,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-17 10:48:28,301 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-10-17 10:48:28,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 109 transitions, 428 flow. Second operand has 8 states, 8 states have (on average 90.875) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:28,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:48:28,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-10-17 10:48:28,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:48:28,872 INFO L130 PetriNetUnfolder]: 351/992 cut-off events. [2022-10-17 10:48:28,872 INFO L131 PetriNetUnfolder]: For 4663/5113 co-relation queries the response was YES. [2022-10-17 10:48:28,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3623 conditions, 992 events. 351/992 cut-off events. For 4663/5113 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6165 event pairs, 97 based on Foata normal form. 27/963 useless extension candidates. Maximal degree in co-relation 3537. Up to 353 conditions per place. [2022-10-17 10:48:28,886 INFO L137 encePairwiseOnDemand]: 102/112 looper letters, 29 selfloop transitions, 12 changer transitions 25/143 dead transitions. [2022-10-17 10:48:28,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 143 transitions, 837 flow [2022-10-17 10:48:28,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-17 10:48:28,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-10-17 10:48:28,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1033 transitions. [2022-10-17 10:48:28,893 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.838474025974026 [2022-10-17 10:48:28,893 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1033 transitions. [2022-10-17 10:48:28,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1033 transitions. [2022-10-17 10:48:28,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:48:28,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1033 transitions. [2022-10-17 10:48:28,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 93.9090909090909) internal successors, (1033), 11 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:28,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:28,903 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:28,904 INFO L175 Difference]: Start difference. First operand has 150 places, 109 transitions, 428 flow. Second operand 11 states and 1033 transitions. [2022-10-17 10:48:28,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 143 transitions, 837 flow [2022-10-17 10:48:28,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 143 transitions, 760 flow, removed 37 selfloop flow, removed 12 redundant places. [2022-10-17 10:48:28,920 INFO L231 Difference]: Finished difference. Result has 144 places, 112 transitions, 491 flow [2022-10-17 10:48:28,922 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=491, PETRI_PLACES=144, PETRI_TRANSITIONS=112} [2022-10-17 10:48:28,923 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 27 predicate places. [2022-10-17 10:48:28,923 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 112 transitions, 491 flow [2022-10-17 10:48:28,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.875) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:28,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:48:28,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:48:28,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-17 10:48:28,924 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:48:28,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:48:28,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1297160514, now seen corresponding path program 1 times [2022-10-17 10:48:28,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:48:28,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781580760] [2022-10-17 10:48:28,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:48:28,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:48:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:48:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:48:29,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:48:29,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781580760] [2022-10-17 10:48:29,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781580760] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:48:29,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:48:29,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:48:29,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504467164] [2022-10-17 10:48:29,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:48:29,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:48:29,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:48:29,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:48:29,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:48:29,173 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-10-17 10:48:29,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 112 transitions, 491 flow. Second operand has 6 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:29,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:48:29,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-10-17 10:48:29,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:48:30,447 INFO L130 PetriNetUnfolder]: 1954/3776 cut-off events. [2022-10-17 10:48:30,447 INFO L131 PetriNetUnfolder]: For 24431/24780 co-relation queries the response was YES. [2022-10-17 10:48:30,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14517 conditions, 3776 events. 1954/3776 cut-off events. For 24431/24780 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 26585 event pairs, 77 based on Foata normal form. 235/3881 useless extension candidates. Maximal degree in co-relation 14435. Up to 1149 conditions per place. [2022-10-17 10:48:30,507 INFO L137 encePairwiseOnDemand]: 102/112 looper letters, 56 selfloop transitions, 6 changer transitions 90/231 dead transitions. [2022-10-17 10:48:30,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 231 transitions, 1721 flow [2022-10-17 10:48:30,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-17 10:48:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-10-17 10:48:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 962 transitions. [2022-10-17 10:48:30,511 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8589285714285714 [2022-10-17 10:48:30,511 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 962 transitions. [2022-10-17 10:48:30,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 962 transitions. [2022-10-17 10:48:30,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:48:30,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 962 transitions. [2022-10-17 10:48:30,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.2) internal successors, (962), 10 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:30,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:30,520 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:30,520 INFO L175 Difference]: Start difference. First operand has 144 places, 112 transitions, 491 flow. Second operand 10 states and 962 transitions. [2022-10-17 10:48:30,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 231 transitions, 1721 flow [2022-10-17 10:48:30,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 231 transitions, 1623 flow, removed 27 selfloop flow, removed 6 redundant places. [2022-10-17 10:48:30,558 INFO L231 Difference]: Finished difference. Result has 147 places, 114 transitions, 519 flow [2022-10-17 10:48:30,558 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=519, PETRI_PLACES=147, PETRI_TRANSITIONS=114} [2022-10-17 10:48:30,559 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 30 predicate places. [2022-10-17 10:48:30,559 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 114 transitions, 519 flow [2022-10-17 10:48:30,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:30,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:48:30,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:48:30,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-17 10:48:30,561 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:48:30,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:48:30,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2142872252, now seen corresponding path program 1 times [2022-10-17 10:48:30,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:48:30,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265525306] [2022-10-17 10:48:30,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:48:30,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:48:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:48:30,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:48:30,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:48:30,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265525306] [2022-10-17 10:48:30,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265525306] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:48:30,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:48:30,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:48:30,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587264167] [2022-10-17 10:48:30,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:48:30,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:48:30,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:48:30,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:48:30,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:48:30,886 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-10-17 10:48:30,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 114 transitions, 519 flow. Second operand has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:30,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:48:30,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-10-17 10:48:30,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:48:31,572 INFO L130 PetriNetUnfolder]: 638/1562 cut-off events. [2022-10-17 10:48:31,572 INFO L131 PetriNetUnfolder]: For 9785/9911 co-relation queries the response was YES. [2022-10-17 10:48:31,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6476 conditions, 1562 events. 638/1562 cut-off events. For 9785/9911 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10362 event pairs, 19 based on Foata normal form. 138/1679 useless extension candidates. Maximal degree in co-relation 6391. Up to 381 conditions per place. [2022-10-17 10:48:31,592 INFO L137 encePairwiseOnDemand]: 103/112 looper letters, 55 selfloop transitions, 9 changer transitions 51/194 dead transitions. [2022-10-17 10:48:31,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 194 transitions, 1467 flow [2022-10-17 10:48:31,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-17 10:48:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-10-17 10:48:31,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 960 transitions. [2022-10-17 10:48:31,596 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2022-10-17 10:48:31,596 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 960 transitions. [2022-10-17 10:48:31,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 960 transitions. [2022-10-17 10:48:31,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:48:31,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 960 transitions. [2022-10-17 10:48:31,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:31,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:31,606 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:31,606 INFO L175 Difference]: Start difference. First operand has 147 places, 114 transitions, 519 flow. Second operand 10 states and 960 transitions. [2022-10-17 10:48:31,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 194 transitions, 1467 flow [2022-10-17 10:48:31,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 194 transitions, 1431 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-10-17 10:48:31,634 INFO L231 Difference]: Finished difference. Result has 150 places, 116 transitions, 573 flow [2022-10-17 10:48:31,635 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=573, PETRI_PLACES=150, PETRI_TRANSITIONS=116} [2022-10-17 10:48:31,636 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 33 predicate places. [2022-10-17 10:48:31,636 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 116 transitions, 573 flow [2022-10-17 10:48:31,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:31,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:48:31,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:48:31,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-17 10:48:31,638 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:48:31,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:48:31,638 INFO L85 PathProgramCache]: Analyzing trace with hash 903364591, now seen corresponding path program 1 times [2022-10-17 10:48:31,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:48:31,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135248042] [2022-10-17 10:48:31,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:48:31,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:48:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:48:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:48:32,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:48:32,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135248042] [2022-10-17 10:48:32,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135248042] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:48:32,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:48:32,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-17 10:48:32,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716154933] [2022-10-17 10:48:32,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:48:32,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-17 10:48:32,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:48:32,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-17 10:48:32,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-17 10:48:32,016 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-10-17 10:48:32,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 116 transitions, 573 flow. Second operand has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:32,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:48:32,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-10-17 10:48:32,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:48:32,491 INFO L130 PetriNetUnfolder]: 201/664 cut-off events. [2022-10-17 10:48:32,491 INFO L131 PetriNetUnfolder]: For 3692/3725 co-relation queries the response was YES. [2022-10-17 10:48:32,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2719 conditions, 664 events. 201/664 cut-off events. For 3692/3725 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3657 event pairs, 14 based on Foata normal form. 29/680 useless extension candidates. Maximal degree in co-relation 2644. Up to 137 conditions per place. [2022-10-17 10:48:32,501 INFO L137 encePairwiseOnDemand]: 103/112 looper letters, 33 selfloop transitions, 12 changer transitions 36/158 dead transitions. [2022-10-17 10:48:32,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 158 transitions, 1141 flow [2022-10-17 10:48:32,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-17 10:48:32,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-10-17 10:48:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1027 transitions. [2022-10-17 10:48:32,505 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8336038961038961 [2022-10-17 10:48:32,505 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1027 transitions. [2022-10-17 10:48:32,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1027 transitions. [2022-10-17 10:48:32,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:48:32,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1027 transitions. [2022-10-17 10:48:32,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 93.36363636363636) internal successors, (1027), 11 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:32,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:32,516 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:32,516 INFO L175 Difference]: Start difference. First operand has 150 places, 116 transitions, 573 flow. Second operand 11 states and 1027 transitions. [2022-10-17 10:48:32,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 158 transitions, 1141 flow [2022-10-17 10:48:32,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 158 transitions, 953 flow, removed 79 selfloop flow, removed 17 redundant places. [2022-10-17 10:48:32,544 INFO L231 Difference]: Finished difference. Result has 145 places, 108 transitions, 444 flow [2022-10-17 10:48:32,544 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=444, PETRI_PLACES=145, PETRI_TRANSITIONS=108} [2022-10-17 10:48:32,545 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 28 predicate places. [2022-10-17 10:48:32,545 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 108 transitions, 444 flow [2022-10-17 10:48:32,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:32,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:48:32,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:48:32,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-17 10:48:32,547 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:48:32,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:48:32,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1837034471, now seen corresponding path program 1 times [2022-10-17 10:48:32,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:48:32,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362697316] [2022-10-17 10:48:32,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:48:32,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:48:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:48:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:48:34,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:48:34,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362697316] [2022-10-17 10:48:34,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362697316] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:48:34,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:48:34,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-10-17 10:48:34,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583043913] [2022-10-17 10:48:34,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:48:34,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-17 10:48:34,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:48:34,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-17 10:48:34,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-10-17 10:48:34,466 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 112 [2022-10-17 10:48:34,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 108 transitions, 444 flow. Second operand has 15 states, 15 states have (on average 83.66666666666667) internal successors, (1255), 15 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:34,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:48:34,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 112 [2022-10-17 10:48:34,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:48:34,844 INFO L130 PetriNetUnfolder]: 63/418 cut-off events. [2022-10-17 10:48:34,844 INFO L131 PetriNetUnfolder]: For 845/894 co-relation queries the response was YES. [2022-10-17 10:48:34,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 418 events. 63/418 cut-off events. For 845/894 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2194 event pairs, 7 based on Foata normal form. 1/405 useless extension candidates. Maximal degree in co-relation 1154. Up to 63 conditions per place. [2022-10-17 10:48:34,850 INFO L137 encePairwiseOnDemand]: 100/112 looper letters, 24 selfloop transitions, 10 changer transitions 9/117 dead transitions. [2022-10-17 10:48:34,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 117 transitions, 574 flow [2022-10-17 10:48:34,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-17 10:48:34,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-10-17 10:48:34,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1020 transitions. [2022-10-17 10:48:34,857 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7589285714285714 [2022-10-17 10:48:34,858 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1020 transitions. [2022-10-17 10:48:34,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1020 transitions. [2022-10-17 10:48:34,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:48:34,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1020 transitions. [2022-10-17 10:48:34,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 85.0) internal successors, (1020), 12 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:34,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:34,875 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:34,875 INFO L175 Difference]: Start difference. First operand has 145 places, 108 transitions, 444 flow. Second operand 12 states and 1020 transitions. [2022-10-17 10:48:34,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 117 transitions, 574 flow [2022-10-17 10:48:34,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 117 transitions, 442 flow, removed 43 selfloop flow, removed 23 redundant places. [2022-10-17 10:48:34,887 INFO L231 Difference]: Finished difference. Result has 131 places, 104 transitions, 331 flow [2022-10-17 10:48:34,888 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=331, PETRI_PLACES=131, PETRI_TRANSITIONS=104} [2022-10-17 10:48:34,889 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 14 predicate places. [2022-10-17 10:48:34,889 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 104 transitions, 331 flow [2022-10-17 10:48:34,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 83.66666666666667) internal successors, (1255), 15 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:48:34,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:48:34,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:48:34,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-17 10:48:34,893 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:48:34,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:48:34,893 INFO L85 PathProgramCache]: Analyzing trace with hash 468578735, now seen corresponding path program 2 times [2022-10-17 10:48:34,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:48:34,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099230138] [2022-10-17 10:48:34,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:48:34,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:48:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:48:34,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:48:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:48:35,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:48:35,111 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-17 10:48:35,113 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-10-17 10:48:35,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-10-17 10:48:35,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-10-17 10:48:35,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-10-17 10:48:35,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-10-17 10:48:35,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-10-17 10:48:35,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-17 10:48:35,117 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:48:35,124 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-17 10:48:35,124 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-17 10:48:35,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.10 10:48:35 BasicIcfg [2022-10-17 10:48:35,338 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-17 10:48:35,339 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-10-17 10:48:35,339 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-10-17 10:48:35,339 INFO L275 PluginConnector]: Witness Printer initialized [2022-10-17 10:48:35,340 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:48:14" (3/4) ... [2022-10-17 10:48:35,342 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-10-17 10:48:35,475 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d1d8464-0fbf-458c-9c7d-00cb6ad496df/bin/uautomizer-J5u9QxTXDZ/witness.graphml [2022-10-17 10:48:35,475 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-10-17 10:48:35,476 INFO L158 Benchmark]: Toolchain (without parser) took 23363.96ms. Allocated memory was 88.1MB in the beginning and 478.2MB in the end (delta: 390.1MB). Free memory was 48.2MB in the beginning and 380.0MB in the end (delta: -331.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2022-10-17 10:48:35,477 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 88.1MB. Free memory is still 66.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 10:48:35,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 768.72ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 48.0MB in the beginning and 66.7MB in the end (delta: -18.7MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2022-10-17 10:48:35,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.30ms. Allocated memory is still 107.0MB. Free memory was 66.7MB in the beginning and 63.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-10-17 10:48:35,479 INFO L158 Benchmark]: Boogie Preprocessor took 85.10ms. Allocated memory is still 107.0MB. Free memory was 63.9MB in the beginning and 61.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 10:48:35,479 INFO L158 Benchmark]: RCFGBuilder took 1655.77ms. Allocated memory is still 107.0MB. Free memory was 61.4MB in the beginning and 36.9MB in the end (delta: 24.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-10-17 10:48:35,480 INFO L158 Benchmark]: TraceAbstraction took 20605.94ms. Allocated memory was 107.0MB in the beginning and 478.2MB in the end (delta: 371.2MB). Free memory was 36.1MB in the beginning and 406.3MB in the end (delta: -370.1MB). Peak memory consumption was 259.8MB. Max. memory is 16.1GB. [2022-10-17 10:48:35,480 INFO L158 Benchmark]: Witness Printer took 136.48ms. Allocated memory is still 478.2MB. Free memory was 406.3MB in the beginning and 380.0MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-10-17 10:48:35,486 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 88.1MB. Free memory is still 66.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 768.72ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 48.0MB in the beginning and 66.7MB in the end (delta: -18.7MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.30ms. Allocated memory is still 107.0MB. Free memory was 66.7MB in the beginning and 63.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.10ms. Allocated memory is still 107.0MB. Free memory was 63.9MB in the beginning and 61.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1655.77ms. Allocated memory is still 107.0MB. Free memory was 61.4MB in the beginning and 36.9MB in the end (delta: 24.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 20605.94ms. Allocated memory was 107.0MB in the beginning and 478.2MB in the end (delta: 371.2MB). Free memory was 36.1MB in the beginning and 406.3MB in the end (delta: -370.1MB). Peak memory consumption was 259.8MB. Max. memory is 16.1GB. * Witness Printer took 136.48ms. Allocated memory is still 478.2MB. Free memory was 406.3MB in the beginning and 380.0MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] 0 pthread_t t2177; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2177, ((void *)0), P0, ((void *)0))=-2, t2177={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t2178; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2178, ((void *)0), P1, ((void *)0))=-1, t2177={5:0}, t2178={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 pthread_t t2179; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2179, ((void *)0), P2, ((void *)0))=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=66, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 710 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 710 mSDsluCounter, 593 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1062 mSDsCounter, 187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1735 IncrementalHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 187 mSolverCounterUnsat, 122 mSDtfsCounter, 1735 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=573occurred in iteration=12, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 1145 NumberOfCodeBlocks, 1145 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1045 ConstructedInterpolants, 0 QuantifiedInterpolants, 5756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-10-17 10:48:35,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d1d8464-0fbf-458c-9c7d-00cb6ad496df/bin/uautomizer-J5u9QxTXDZ/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