./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854d9251-d372-4ad9-b4d7-8fa99a5fc24c/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854d9251-d372-4ad9-b4d7-8fa99a5fc24c/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854d9251-d372-4ad9-b4d7-8fa99a5fc24c/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854d9251-d372-4ad9-b4d7-8fa99a5fc24c/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854d9251-d372-4ad9-b4d7-8fa99a5fc24c/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854d9251-d372-4ad9-b4d7-8fa99a5fc24c/bin/uautomizer-ug76WZFUDN --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 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 --- 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-6b4ec56 [2022-11-20 12:36:01,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:36:01,684 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:36:01,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:36:01,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:36:01,714 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:36:01,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:36:01,719 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:36:01,721 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:36:01,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:36:01,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:36:01,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:36:01,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:36:01,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:36:01,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:36:01,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:36:01,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:36:01,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:36:01,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:36:01,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:36:01,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:36:01,743 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:36:01,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:36:01,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:36:01,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:36:01,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:36:01,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:36:01,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:36:01,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:36:01,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:36:01,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:36:01,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:36:01,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:36:01,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:36:01,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:36:01,762 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:36:01,763 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:36:01,763 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:36:01,764 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:36:01,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:36:01,766 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:36:01,768 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854d9251-d372-4ad9-b4d7-8fa99a5fc24c/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 12:36:01,798 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:36:01,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:36:01,799 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:36:01,799 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:36:01,800 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:36:01,800 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:36:01,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:36:01,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:36:01,802 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:36:01,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:36:01,803 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:36:01,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:36:01,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:36:01,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:36:01,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:36:01,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:36:01,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:36:01,805 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:36:01,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:36:01,806 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:36:01,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:36:01,807 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:36:01,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:36:01,807 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:36:01,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:36:01,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:36:01,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:36:01,809 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:36:01,809 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:36:01,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:36:01,809 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:36:01,810 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:36:01,810 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:36:01,810 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_854d9251-d372-4ad9-b4d7-8fa99a5fc24c/bin/uautomizer-ug76WZFUDN/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_854d9251-d372-4ad9-b4d7-8fa99a5fc24c/bin/uautomizer-ug76WZFUDN 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 -> 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 [2022-11-20 12:36:02,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:36:02,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:36:02,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:36:02,181 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:36:02,181 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:36:02,183 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854d9251-d372-4ad9-b4d7-8fa99a5fc24c/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-11-20 12:36:05,778 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:36:06,080 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:36:06,081 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854d9251-d372-4ad9-b4d7-8fa99a5fc24c/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-11-20 12:36:06,107 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854d9251-d372-4ad9-b4d7-8fa99a5fc24c/bin/uautomizer-ug76WZFUDN/data/cd2eace59/084aecefb1f9408bb572c9322c281d1b/FLAGcabaf9d8a [2022-11-20 12:36:06,124 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854d9251-d372-4ad9-b4d7-8fa99a5fc24c/bin/uautomizer-ug76WZFUDN/data/cd2eace59/084aecefb1f9408bb572c9322c281d1b [2022-11-20 12:36:06,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:36:06,130 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:36:06,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:36:06,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:36:06,139 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:36:06,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:36:06" (1/1) ... [2022-11-20 12:36:06,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57d2d78d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:36:06, skipping insertion in model container [2022-11-20 12:36:06,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:36:06" (1/1) ... [2022-11-20 12:36:06,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:36:06,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:36:06,434 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854d9251-d372-4ad9-b4d7-8fa99a5fc24c/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-11-20 12:36:06,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:36:06,735 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:36:06,755 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854d9251-d372-4ad9-b4d7-8fa99a5fc24c/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-11-20 12:36:06,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:36:06,918 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:36:06,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:36:06 WrapperNode [2022-11-20 12:36:06,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:36:06,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:36:06,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:36:06,921 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:36:06,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:36:06" (1/1) ... [2022-11-20 12:36:06,979 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:36:06" (1/1) ... [2022-11-20 12:36:07,027 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-11-20 12:36:07,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:36:07,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:36:07,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:36:07,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:36:07,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:36:06" (1/1) ... [2022-11-20 12:36:07,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:36:06" (1/1) ... [2022-11-20 12:36:07,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:36:06" (1/1) ... [2022-11-20 12:36:07,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:36:06" (1/1) ... [2022-11-20 12:36:07,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:36:06" (1/1) ... [2022-11-20 12:36:07,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:36:06" (1/1) ... [2022-11-20 12:36:07,090 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:36:06" (1/1) ... [2022-11-20 12:36:07,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:36:06" (1/1) ... [2022-11-20 12:36:07,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:36:07,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:36:07,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:36:07,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:36:07,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:36:06" (1/1) ... [2022-11-20 12:36:07,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:36:07,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854d9251-d372-4ad9-b4d7-8fa99a5fc24c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:36:07,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854d9251-d372-4ad9-b4d7-8fa99a5fc24c/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:36:07,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854d9251-d372-4ad9-b4d7-8fa99a5fc24c/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:36:07,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:36:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 12:36:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:36:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:36:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:36:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 12:36:07,239 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 12:36:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 12:36:07,240 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 12:36:07,240 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 12:36:07,241 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 12:36:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:36:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 12:36:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:36:07,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:36:07,243 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 12:36:07,499 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:36:07,505 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:36:07,949 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:36:08,331 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:36:08,331 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 12:36:08,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:36:08 BoogieIcfgContainer [2022-11-20 12:36:08,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:36:08,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:36:08,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:36:08,345 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:36:08,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:36:06" (1/3) ... [2022-11-20 12:36:08,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbe28c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:36:08, skipping insertion in model container [2022-11-20 12:36:08,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:36:06" (2/3) ... [2022-11-20 12:36:08,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbe28c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:36:08, skipping insertion in model container [2022-11-20 12:36:08,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:36:08" (3/3) ... [2022-11-20 12:36:08,349 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-11-20 12:36:08,363 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 12:36:08,376 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:36:08,376 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 12:36:08,376 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:36:08,472 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 12:36:08,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-11-20 12:36:08,591 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-11-20 12:36:08,591 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:36:08,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-20 12:36:08,599 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-11-20 12:36:08,604 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-11-20 12:36:08,615 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:36:08,623 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;@33c7d0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:36:08,624 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-20 12:36:08,638 INFO L130 PetriNetUnfolder]: 0/45 cut-off events. [2022-11-20 12:36:08,638 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:36:08,638 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:36:08,639 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:08,640 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-11-20 12:36:08,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:08,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1284205377, now seen corresponding path program 1 times [2022-11-20 12:36:08,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:08,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627731590] [2022-11-20 12:36:08,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:08,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:09,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:36:09,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:09,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627731590] [2022-11-20 12:36:09,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627731590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:09,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:09,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:36:09,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971640966] [2022-11-20 12:36:09,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:09,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:36:09,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:09,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:36:09,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:36:09,463 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 114 [2022-11-20 12:36:09,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:09,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:36:09,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 114 [2022-11-20 12:36:09,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:36:09,726 INFO L130 PetriNetUnfolder]: 58/326 cut-off events. [2022-11-20 12:36:09,727 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-20 12:36:09,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 326 events. 58/326 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1344 event pairs, 10 based on Foata normal form. 12/321 useless extension candidates. Maximal degree in co-relation 404. Up to 79 conditions per place. [2022-11-20 12:36:09,733 INFO L137 encePairwiseOnDemand]: 109/114 looper letters, 14 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2022-11-20 12:36:09,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 113 transitions, 273 flow [2022-11-20 12:36:09,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:36:09,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:36:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-11-20 12:36:09,751 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9385964912280702 [2022-11-20 12:36:09,752 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2022-11-20 12:36:09,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2022-11-20 12:36:09,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:36:09,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2022-11-20 12:36:09,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:09,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:09,769 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:09,771 INFO L175 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 321 transitions. [2022-11-20 12:36:09,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 113 transitions, 273 flow [2022-11-20 12:36:09,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 113 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 12:36:09,780 INFO L231 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2022-11-20 12:36:09,783 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2022-11-20 12:36:09,787 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2022-11-20 12:36:09,788 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2022-11-20 12:36:09,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:09,788 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:36:09,789 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:09,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:36:09,789 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-11-20 12:36:09,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:09,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1243796926, now seen corresponding path program 1 times [2022-11-20 12:36:09,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:09,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464701530] [2022-11-20 12:36:09,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:09,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:10,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:36:10,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:10,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464701530] [2022-11-20 12:36:10,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464701530] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:10,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:10,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:36:10,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738421820] [2022-11-20 12:36:10,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:10,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:36:10,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:10,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:36:10,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:36:10,452 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 114 [2022-11-20 12:36:10,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:10,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:36:10,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 114 [2022-11-20 12:36:10,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:36:11,210 INFO L130 PetriNetUnfolder]: 331/1079 cut-off events. [2022-11-20 12:36:11,211 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-11-20 12:36:11,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1712 conditions, 1079 events. 331/1079 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7309 event pairs, 54 based on Foata normal form. 0/1046 useless extension candidates. Maximal degree in co-relation 1661. Up to 257 conditions per place. [2022-11-20 12:36:11,220 INFO L137 encePairwiseOnDemand]: 108/114 looper letters, 18 selfloop transitions, 2 changer transitions 45/144 dead transitions. [2022-11-20 12:36:11,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 144 transitions, 420 flow [2022-11-20 12:36:11,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:36:11,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 12:36:11,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 893 transitions. [2022-11-20 12:36:11,232 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8703703703703703 [2022-11-20 12:36:11,232 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 893 transitions. [2022-11-20 12:36:11,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 893 transitions. [2022-11-20 12:36:11,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:36:11,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 893 transitions. [2022-11-20 12:36:11,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.22222222222223) internal successors, (893), 9 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:11,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:11,246 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:11,246 INFO L175 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 9 states and 893 transitions. [2022-11-20 12:36:11,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 144 transitions, 420 flow [2022-11-20 12:36:11,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 144 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:36:11,254 INFO L231 Difference]: Finished difference. Result has 129 places, 95 transitions, 216 flow [2022-11-20 12:36:11,254 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=216, PETRI_PLACES=129, PETRI_TRANSITIONS=95} [2022-11-20 12:36:11,255 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2022-11-20 12:36:11,256 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 95 transitions, 216 flow [2022-11-20 12:36:11,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:11,257 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:36:11,257 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:11,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:36:11,258 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-11-20 12:36:11,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:11,262 INFO L85 PathProgramCache]: Analyzing trace with hash 924758451, now seen corresponding path program 1 times [2022-11-20 12:36:11,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:11,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748223026] [2022-11-20 12:36:11,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:11,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:36:12,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:12,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748223026] [2022-11-20 12:36:12,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748223026] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:12,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:12,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:36:12,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668203076] [2022-11-20 12:36:12,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:12,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:36:12,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:12,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:36:12,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:36:12,697 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-20 12:36:12,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 95 transitions, 216 flow. Second operand has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:12,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:36:12,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-20 12:36:12,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:36:14,769 INFO L130 PetriNetUnfolder]: 1669/3060 cut-off events. [2022-11-20 12:36:14,770 INFO L131 PetriNetUnfolder]: For 894/894 co-relation queries the response was YES. [2022-11-20 12:36:14,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6421 conditions, 3060 events. 1669/3060 cut-off events. For 894/894 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 18457 event pairs, 244 based on Foata normal form. 74/3034 useless extension candidates. Maximal degree in co-relation 6354. Up to 703 conditions per place. [2022-11-20 12:36:14,800 INFO L137 encePairwiseOnDemand]: 98/114 looper letters, 51 selfloop transitions, 19 changer transitions 92/228 dead transitions. [2022-11-20 12:36:14,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 228 transitions, 897 flow [2022-11-20 12:36:14,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 12:36:14,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-20 12:36:14,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1526 transitions. [2022-11-20 12:36:14,809 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7874097007223942 [2022-11-20 12:36:14,809 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1526 transitions. [2022-11-20 12:36:14,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1526 transitions. [2022-11-20 12:36:14,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:36:14,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1526 transitions. [2022-11-20 12:36:14,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 89.76470588235294) internal successors, (1526), 17 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:14,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:14,826 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:14,826 INFO L175 Difference]: Start difference. First operand has 129 places, 95 transitions, 216 flow. Second operand 17 states and 1526 transitions. [2022-11-20 12:36:14,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 228 transitions, 897 flow [2022-11-20 12:36:14,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 228 transitions, 807 flow, removed 40 selfloop flow, removed 8 redundant places. [2022-11-20 12:36:14,868 INFO L231 Difference]: Finished difference. Result has 135 places, 110 transitions, 424 flow [2022-11-20 12:36:14,869 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=424, PETRI_PLACES=135, PETRI_TRANSITIONS=110} [2022-11-20 12:36:14,872 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 16 predicate places. [2022-11-20 12:36:14,872 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 110 transitions, 424 flow [2022-11-20 12:36:14,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:14,873 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:36:14,873 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:14,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:36:14,874 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-11-20 12:36:14,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:14,875 INFO L85 PathProgramCache]: Analyzing trace with hash -156252707, now seen corresponding path program 2 times [2022-11-20 12:36:14,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:14,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253499834] [2022-11-20 12:36:14,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:14,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:15,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:36:15,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:15,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253499834] [2022-11-20 12:36:15,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253499834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:15,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:15,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:36:15,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257884840] [2022-11-20 12:36:15,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:15,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:36:15,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:15,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:36:15,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:36:15,877 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-20 12:36:15,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 110 transitions, 424 flow. Second operand has 8 states, 8 states have (on average 82.625) internal successors, (661), 8 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:15,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:36:15,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-20 12:36:15,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:36:16,980 INFO L130 PetriNetUnfolder]: 1281/2314 cut-off events. [2022-11-20 12:36:16,980 INFO L131 PetriNetUnfolder]: For 15383/25251 co-relation queries the response was YES. [2022-11-20 12:36:16,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11070 conditions, 2314 events. 1281/2314 cut-off events. For 15383/25251 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13008 event pairs, 177 based on Foata normal form. 66/2272 useless extension candidates. Maximal degree in co-relation 10989. Up to 940 conditions per place. [2022-11-20 12:36:17,002 INFO L137 encePairwiseOnDemand]: 101/114 looper letters, 45 selfloop transitions, 11 changer transitions 80/202 dead transitions. [2022-11-20 12:36:17,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 202 transitions, 1559 flow [2022-11-20 12:36:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 12:36:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 12:36:17,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 982 transitions. [2022-11-20 12:36:17,007 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7830940988835726 [2022-11-20 12:36:17,007 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 982 transitions. [2022-11-20 12:36:17,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 982 transitions. [2022-11-20 12:36:17,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:36:17,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 982 transitions. [2022-11-20 12:36:17,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 89.27272727272727) internal successors, (982), 11 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:17,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:17,023 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:17,023 INFO L175 Difference]: Start difference. First operand has 135 places, 110 transitions, 424 flow. Second operand 11 states and 982 transitions. [2022-11-20 12:36:17,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 202 transitions, 1559 flow [2022-11-20 12:36:17,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 202 transitions, 1507 flow, removed 26 selfloop flow, removed 3 redundant places. [2022-11-20 12:36:17,078 INFO L231 Difference]: Finished difference. Result has 140 places, 109 transitions, 461 flow [2022-11-20 12:36:17,078 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=461, PETRI_PLACES=140, PETRI_TRANSITIONS=109} [2022-11-20 12:36:17,081 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 21 predicate places. [2022-11-20 12:36:17,082 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 109 transitions, 461 flow [2022-11-20 12:36:17,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.625) internal successors, (661), 8 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:17,083 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:36:17,083 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:17,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:36:17,085 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-11-20 12:36:17,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:17,086 INFO L85 PathProgramCache]: Analyzing trace with hash 686710655, now seen corresponding path program 1 times [2022-11-20 12:36:17,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:17,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795802317] [2022-11-20 12:36:17,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:17,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:18,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:36:18,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:18,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795802317] [2022-11-20 12:36:18,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795802317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:18,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:18,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:36:18,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390520550] [2022-11-20 12:36:18,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:18,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:36:18,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:18,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:36:18,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:36:18,652 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 114 [2022-11-20 12:36:18,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 109 transitions, 461 flow. Second operand has 9 states, 9 states have (on average 84.33333333333333) internal successors, (759), 9 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:18,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:36:18,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 114 [2022-11-20 12:36:18,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:36:20,474 INFO L130 PetriNetUnfolder]: 682/1472 cut-off events. [2022-11-20 12:36:20,475 INFO L131 PetriNetUnfolder]: For 9556/11539 co-relation queries the response was YES. [2022-11-20 12:36:20,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7070 conditions, 1472 events. 682/1472 cut-off events. For 9556/11539 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8130 event pairs, 114 based on Foata normal form. 47/1470 useless extension candidates. Maximal degree in co-relation 7044. Up to 622 conditions per place. [2022-11-20 12:36:20,494 INFO L137 encePairwiseOnDemand]: 96/114 looper letters, 39 selfloop transitions, 43 changer transitions 83/234 dead transitions. [2022-11-20 12:36:20,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 234 transitions, 1952 flow [2022-11-20 12:36:20,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 12:36:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-11-20 12:36:20,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1952 transitions. [2022-11-20 12:36:20,501 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7783094098883573 [2022-11-20 12:36:20,501 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1952 transitions. [2022-11-20 12:36:20,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1952 transitions. [2022-11-20 12:36:20,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:36:20,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1952 transitions. [2022-11-20 12:36:20,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 88.72727272727273) internal successors, (1952), 22 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:20,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 114.0) internal successors, (2622), 23 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:20,518 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 114.0) internal successors, (2622), 23 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:20,518 INFO L175 Difference]: Start difference. First operand has 140 places, 109 transitions, 461 flow. Second operand 22 states and 1952 transitions. [2022-11-20 12:36:20,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 234 transitions, 1952 flow [2022-11-20 12:36:20,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 234 transitions, 1800 flow, removed 43 selfloop flow, removed 11 redundant places. [2022-11-20 12:36:20,541 INFO L231 Difference]: Finished difference. Result has 162 places, 134 transitions, 816 flow [2022-11-20 12:36:20,541 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=816, PETRI_PLACES=162, PETRI_TRANSITIONS=134} [2022-11-20 12:36:20,545 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 43 predicate places. [2022-11-20 12:36:20,545 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 134 transitions, 816 flow [2022-11-20 12:36:20,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 84.33333333333333) internal successors, (759), 9 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:20,546 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:36:20,547 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:20,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:36:20,547 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-11-20 12:36:20,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:20,549 INFO L85 PathProgramCache]: Analyzing trace with hash 72497903, now seen corresponding path program 1 times [2022-11-20 12:36:20,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:20,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530236269] [2022-11-20 12:36:20,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:20,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:21,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:36:21,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:21,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530236269] [2022-11-20 12:36:21,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530236269] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:21,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:21,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 12:36:21,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096674186] [2022-11-20 12:36:21,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:21,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 12:36:21,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:21,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:36:21,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:36:21,543 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-11-20 12:36:21,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 134 transitions, 816 flow. Second operand has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:21,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:36:21,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-11-20 12:36:21,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:36:22,355 INFO L130 PetriNetUnfolder]: 524/1071 cut-off events. [2022-11-20 12:36:22,356 INFO L131 PetriNetUnfolder]: For 19075/21768 co-relation queries the response was YES. [2022-11-20 12:36:22,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7380 conditions, 1071 events. 524/1071 cut-off events. For 19075/21768 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5208 event pairs, 117 based on Foata normal form. 151/1184 useless extension candidates. Maximal degree in co-relation 7344. Up to 548 conditions per place. [2022-11-20 12:36:22,375 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 48 selfloop transitions, 8 changer transitions 34/175 dead transitions. [2022-11-20 12:36:22,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 175 transitions, 1724 flow [2022-11-20 12:36:22,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:36:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 12:36:22,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1213 transitions. [2022-11-20 12:36:22,380 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8184885290148448 [2022-11-20 12:36:22,381 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1213 transitions. [2022-11-20 12:36:22,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1213 transitions. [2022-11-20 12:36:22,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:36:22,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1213 transitions. [2022-11-20 12:36:22,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 93.3076923076923) internal successors, (1213), 13 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:22,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:22,391 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:22,392 INFO L175 Difference]: Start difference. First operand has 162 places, 134 transitions, 816 flow. Second operand 13 states and 1213 transitions. [2022-11-20 12:36:22,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 175 transitions, 1724 flow [2022-11-20 12:36:22,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 175 transitions, 1484 flow, removed 119 selfloop flow, removed 16 redundant places. [2022-11-20 12:36:22,426 INFO L231 Difference]: Finished difference. Result has 150 places, 134 transitions, 787 flow [2022-11-20 12:36:22,427 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=787, PETRI_PLACES=150, PETRI_TRANSITIONS=134} [2022-11-20 12:36:22,430 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 31 predicate places. [2022-11-20 12:36:22,430 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 134 transitions, 787 flow [2022-11-20 12:36:22,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:22,431 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:36:22,432 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:22,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:36:22,432 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-11-20 12:36:22,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:22,433 INFO L85 PathProgramCache]: Analyzing trace with hash 851274835, now seen corresponding path program 1 times [2022-11-20 12:36:22,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:22,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261393509] [2022-11-20 12:36:22,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:22,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:24,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:36:24,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:24,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261393509] [2022-11-20 12:36:24,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261393509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:24,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:24,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-20 12:36:24,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550046032] [2022-11-20 12:36:24,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:24,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 12:36:24,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:24,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 12:36:24,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:36:24,413 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 114 [2022-11-20 12:36:24,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 134 transitions, 787 flow. Second operand has 12 states, 12 states have (on average 83.83333333333333) internal successors, (1006), 12 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:24,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:36:24,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 114 [2022-11-20 12:36:24,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:36:26,138 INFO L130 PetriNetUnfolder]: 567/1224 cut-off events. [2022-11-20 12:36:26,139 INFO L131 PetriNetUnfolder]: For 10258/11488 co-relation queries the response was YES. [2022-11-20 12:36:26,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6778 conditions, 1224 events. 567/1224 cut-off events. For 10258/11488 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6213 event pairs, 94 based on Foata normal form. 72/1246 useless extension candidates. Maximal degree in co-relation 6749. Up to 533 conditions per place. [2022-11-20 12:36:26,157 INFO L137 encePairwiseOnDemand]: 97/114 looper letters, 61 selfloop transitions, 54 changer transitions 84/268 dead transitions. [2022-11-20 12:36:26,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 268 transitions, 2727 flow [2022-11-20 12:36:26,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 12:36:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-20 12:36:26,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1852 transitions. [2022-11-20 12:36:26,163 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7736006683375104 [2022-11-20 12:36:26,163 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1852 transitions. [2022-11-20 12:36:26,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1852 transitions. [2022-11-20 12:36:26,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:36:26,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1852 transitions. [2022-11-20 12:36:26,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 88.19047619047619) internal successors, (1852), 21 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:26,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 114.0) internal successors, (2508), 22 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:26,178 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 114.0) internal successors, (2508), 22 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:26,178 INFO L175 Difference]: Start difference. First operand has 150 places, 134 transitions, 787 flow. Second operand 21 states and 1852 transitions. [2022-11-20 12:36:26,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 268 transitions, 2727 flow [2022-11-20 12:36:26,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 268 transitions, 2654 flow, removed 28 selfloop flow, removed 11 redundant places. [2022-11-20 12:36:26,204 INFO L231 Difference]: Finished difference. Result has 170 places, 168 transitions, 1488 flow [2022-11-20 12:36:26,204 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1488, PETRI_PLACES=170, PETRI_TRANSITIONS=168} [2022-11-20 12:36:26,205 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 51 predicate places. [2022-11-20 12:36:26,205 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 168 transitions, 1488 flow [2022-11-20 12:36:26,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 83.83333333333333) internal successors, (1006), 12 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:26,206 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:36:26,206 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:26,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:36:26,207 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-11-20 12:36:26,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:26,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1156016893, now seen corresponding path program 1 times [2022-11-20 12:36:26,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:26,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606936086] [2022-11-20 12:36:26,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:26,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:28,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:36:28,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:28,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606936086] [2022-11-20 12:36:28,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606936086] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:28,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:28,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 12:36:28,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411688519] [2022-11-20 12:36:28,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:28,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 12:36:28,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:28,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 12:36:28,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:36:28,129 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 114 [2022-11-20 12:36:28,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 168 transitions, 1488 flow. Second operand has 14 states, 14 states have (on average 82.71428571428571) internal successors, (1158), 14 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:28,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:36:28,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 114 [2022-11-20 12:36:28,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:36:30,006 INFO L130 PetriNetUnfolder]: 639/1295 cut-off events. [2022-11-20 12:36:30,006 INFO L131 PetriNetUnfolder]: For 21024/27731 co-relation queries the response was YES. [2022-11-20 12:36:30,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9543 conditions, 1295 events. 639/1295 cut-off events. For 21024/27731 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6441 event pairs, 55 based on Foata normal form. 73/1334 useless extension candidates. Maximal degree in co-relation 9504. Up to 612 conditions per place. [2022-11-20 12:36:30,030 INFO L137 encePairwiseOnDemand]: 93/114 looper letters, 97 selfloop transitions, 88 changer transitions 91/344 dead transitions. [2022-11-20 12:36:30,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 344 transitions, 4723 flow [2022-11-20 12:36:30,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 12:36:30,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-20 12:36:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2082 transitions. [2022-11-20 12:36:30,042 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7609649122807017 [2022-11-20 12:36:30,042 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2082 transitions. [2022-11-20 12:36:30,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2082 transitions. [2022-11-20 12:36:30,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:36:30,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2082 transitions. [2022-11-20 12:36:30,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 86.75) internal successors, (2082), 24 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:30,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 114.0) internal successors, (2850), 25 states have internal predecessors, (2850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:30,063 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 114.0) internal successors, (2850), 25 states have internal predecessors, (2850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:30,063 INFO L175 Difference]: Start difference. First operand has 170 places, 168 transitions, 1488 flow. Second operand 24 states and 2082 transitions. [2022-11-20 12:36:30,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 344 transitions, 4723 flow [2022-11-20 12:36:30,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 344 transitions, 4423 flow, removed 147 selfloop flow, removed 9 redundant places. [2022-11-20 12:36:30,126 INFO L231 Difference]: Finished difference. Result has 189 places, 222 transitions, 2644 flow [2022-11-20 12:36:30,126 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1392, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2644, PETRI_PLACES=189, PETRI_TRANSITIONS=222} [2022-11-20 12:36:30,131 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 70 predicate places. [2022-11-20 12:36:30,131 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 222 transitions, 2644 flow [2022-11-20 12:36:30,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 82.71428571428571) internal successors, (1158), 14 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:30,132 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:36:30,133 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:30,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:36:30,133 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-11-20 12:36:30,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:30,134 INFO L85 PathProgramCache]: Analyzing trace with hash 61079899, now seen corresponding path program 2 times [2022-11-20 12:36:30,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:30,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279280372] [2022-11-20 12:36:30,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:30,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:31,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:36:31,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:31,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279280372] [2022-11-20 12:36:31,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279280372] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:31,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:31,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-20 12:36:31,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981456163] [2022-11-20 12:36:31,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:31,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 12:36:31,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:31,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 12:36:31,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:36:31,587 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 114 [2022-11-20 12:36:31,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 222 transitions, 2644 flow. Second operand has 12 states, 12 states have (on average 83.91666666666667) internal successors, (1007), 12 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:31,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:36:31,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 114 [2022-11-20 12:36:31,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:36:32,844 INFO L130 PetriNetUnfolder]: 526/1158 cut-off events. [2022-11-20 12:36:32,844 INFO L131 PetriNetUnfolder]: For 22703/31614 co-relation queries the response was YES. [2022-11-20 12:36:32,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9045 conditions, 1158 events. 526/1158 cut-off events. For 22703/31614 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5798 event pairs, 91 based on Foata normal form. 103/1204 useless extension candidates. Maximal degree in co-relation 8995. Up to 595 conditions per place. [2022-11-20 12:36:32,883 INFO L137 encePairwiseOnDemand]: 98/114 looper letters, 99 selfloop transitions, 82 changer transitions 57/307 dead transitions. [2022-11-20 12:36:32,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 307 transitions, 4726 flow [2022-11-20 12:36:32,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 12:36:32,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-20 12:36:32,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1652 transitions. [2022-11-20 12:36:32,888 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.76269621421976 [2022-11-20 12:36:32,888 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1652 transitions. [2022-11-20 12:36:32,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1652 transitions. [2022-11-20 12:36:32,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:36:32,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1652 transitions. [2022-11-20 12:36:32,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 86.94736842105263) internal successors, (1652), 19 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:32,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:32,902 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:32,902 INFO L175 Difference]: Start difference. First operand has 189 places, 222 transitions, 2644 flow. Second operand 19 states and 1652 transitions. [2022-11-20 12:36:32,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 307 transitions, 4726 flow [2022-11-20 12:36:32,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 307 transitions, 4452 flow, removed 131 selfloop flow, removed 18 redundant places. [2022-11-20 12:36:32,984 INFO L231 Difference]: Finished difference. Result has 188 places, 235 transitions, 3075 flow [2022-11-20 12:36:32,984 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=2490, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3075, PETRI_PLACES=188, PETRI_TRANSITIONS=235} [2022-11-20 12:36:32,985 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 69 predicate places. [2022-11-20 12:36:32,986 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 235 transitions, 3075 flow [2022-11-20 12:36:32,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 83.91666666666667) internal successors, (1007), 12 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:32,987 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:36:32,987 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:32,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:36:32,988 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-11-20 12:36:32,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:32,989 INFO L85 PathProgramCache]: Analyzing trace with hash 103134375, now seen corresponding path program 3 times [2022-11-20 12:36:32,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:32,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938228113] [2022-11-20 12:36:32,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:32,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:34,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:36:34,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:34,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938228113] [2022-11-20 12:36:34,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938228113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:34,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:34,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-20 12:36:34,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214402218] [2022-11-20 12:36:34,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:34,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 12:36:34,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:34,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 12:36:34,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:36:34,204 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2022-11-20 12:36:34,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 235 transitions, 3075 flow. Second operand has 12 states, 12 states have (on average 88.58333333333333) internal successors, (1063), 12 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:34,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:36:34,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2022-11-20 12:36:34,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:36:35,010 INFO L130 PetriNetUnfolder]: 473/1058 cut-off events. [2022-11-20 12:36:35,011 INFO L131 PetriNetUnfolder]: For 26121/33411 co-relation queries the response was YES. [2022-11-20 12:36:35,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8653 conditions, 1058 events. 473/1058 cut-off events. For 26121/33411 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5338 event pairs, 72 based on Foata normal form. 173/1184 useless extension candidates. Maximal degree in co-relation 8603. Up to 519 conditions per place. [2022-11-20 12:36:35,031 INFO L137 encePairwiseOnDemand]: 101/114 looper letters, 92 selfloop transitions, 51 changer transitions 34/279 dead transitions. [2022-11-20 12:36:35,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 279 transitions, 4325 flow [2022-11-20 12:36:35,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 12:36:35,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-20 12:36:35,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1363 transitions. [2022-11-20 12:36:35,036 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7970760233918128 [2022-11-20 12:36:35,036 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1363 transitions. [2022-11-20 12:36:35,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1363 transitions. [2022-11-20 12:36:35,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:36:35,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1363 transitions. [2022-11-20 12:36:35,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 90.86666666666666) internal successors, (1363), 15 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:35,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:35,045 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:35,045 INFO L175 Difference]: Start difference. First operand has 188 places, 235 transitions, 3075 flow. Second operand 15 states and 1363 transitions. [2022-11-20 12:36:35,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 279 transitions, 4325 flow [2022-11-20 12:36:35,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 279 transitions, 4171 flow, removed 68 selfloop flow, removed 15 redundant places. [2022-11-20 12:36:35,126 INFO L231 Difference]: Finished difference. Result has 185 places, 238 transitions, 3243 flow [2022-11-20 12:36:35,127 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=2997, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3243, PETRI_PLACES=185, PETRI_TRANSITIONS=238} [2022-11-20 12:36:35,128 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 66 predicate places. [2022-11-20 12:36:35,130 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 238 transitions, 3243 flow [2022-11-20 12:36:35,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 88.58333333333333) internal successors, (1063), 12 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:35,131 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:36:35,131 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:35,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:36:35,134 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-11-20 12:36:35,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:35,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1725767777, now seen corresponding path program 1 times [2022-11-20 12:36:35,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:35,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671426956] [2022-11-20 12:36:35,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:35,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:35,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:36:35,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:35,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671426956] [2022-11-20 12:36:35,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671426956] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:35,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:35,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 12:36:35,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954147075] [2022-11-20 12:36:35,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:35,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:36:35,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:35,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:36:35,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:36:35,958 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-11-20 12:36:35,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 238 transitions, 3243 flow. Second operand has 10 states, 10 states have (on average 90.7) internal successors, (907), 10 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:35,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:36:35,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-11-20 12:36:35,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:36:36,887 INFO L130 PetriNetUnfolder]: 497/1106 cut-off events. [2022-11-20 12:36:36,888 INFO L131 PetriNetUnfolder]: For 29703/38894 co-relation queries the response was YES. [2022-11-20 12:36:36,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9662 conditions, 1106 events. 497/1106 cut-off events. For 29703/38894 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5644 event pairs, 78 based on Foata normal form. 144/1197 useless extension candidates. Maximal degree in co-relation 9613. Up to 565 conditions per place. [2022-11-20 12:36:36,909 INFO L137 encePairwiseOnDemand]: 102/114 looper letters, 121 selfloop transitions, 32 changer transitions 43/300 dead transitions. [2022-11-20 12:36:36,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 300 transitions, 5127 flow [2022-11-20 12:36:36,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 12:36:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-20 12:36:36,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1129 transitions. [2022-11-20 12:36:36,921 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8252923976608187 [2022-11-20 12:36:36,922 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1129 transitions. [2022-11-20 12:36:36,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1129 transitions. [2022-11-20 12:36:36,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:36:36,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1129 transitions. [2022-11-20 12:36:36,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 94.08333333333333) internal successors, (1129), 12 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:36,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:36,930 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:36,931 INFO L175 Difference]: Start difference. First operand has 185 places, 238 transitions, 3243 flow. Second operand 12 states and 1129 transitions. [2022-11-20 12:36:36,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 300 transitions, 5127 flow [2022-11-20 12:36:37,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 300 transitions, 5017 flow, removed 25 selfloop flow, removed 10 redundant places. [2022-11-20 12:36:37,043 INFO L231 Difference]: Finished difference. Result has 187 places, 248 transitions, 3562 flow [2022-11-20 12:36:37,044 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=3147, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3562, PETRI_PLACES=187, PETRI_TRANSITIONS=248} [2022-11-20 12:36:37,045 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 68 predicate places. [2022-11-20 12:36:37,045 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 248 transitions, 3562 flow [2022-11-20 12:36:37,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.7) internal successors, (907), 10 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:37,046 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:36:37,046 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:37,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:36:37,047 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-11-20 12:36:37,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:37,047 INFO L85 PathProgramCache]: Analyzing trace with hash -41965794, now seen corresponding path program 1 times [2022-11-20 12:36:37,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:37,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910252954] [2022-11-20 12:36:37,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:37,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:36:37,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:37,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910252954] [2022-11-20 12:36:37,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910252954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:37,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:37,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:36:37,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247441389] [2022-11-20 12:36:37,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:37,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:36:37,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:37,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:36:37,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:36:37,886 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 114 [2022-11-20 12:36:37,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 248 transitions, 3562 flow. Second operand has 7 states, 7 states have (on average 85.42857142857143) internal successors, (598), 7 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:37,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:36:37,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 114 [2022-11-20 12:36:37,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:36:38,661 INFO L130 PetriNetUnfolder]: 515/1281 cut-off events. [2022-11-20 12:36:38,662 INFO L131 PetriNetUnfolder]: For 33949/43687 co-relation queries the response was YES. [2022-11-20 12:36:38,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11082 conditions, 1281 events. 515/1281 cut-off events. For 33949/43687 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7441 event pairs, 99 based on Foata normal form. 43/1262 useless extension candidates. Maximal degree in co-relation 11029. Up to 584 conditions per place. [2022-11-20 12:36:38,686 INFO L137 encePairwiseOnDemand]: 106/114 looper letters, 104 selfloop transitions, 9 changer transitions 125/306 dead transitions. [2022-11-20 12:36:38,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 306 transitions, 5231 flow [2022-11-20 12:36:38,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:36:38,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 12:36:38,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 631 transitions. [2022-11-20 12:36:38,690 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7907268170426065 [2022-11-20 12:36:38,690 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 631 transitions. [2022-11-20 12:36:38,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 631 transitions. [2022-11-20 12:36:38,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:36:38,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 631 transitions. [2022-11-20 12:36:38,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 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-11-20 12:36:38,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:38,698 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:38,698 INFO L175 Difference]: Start difference. First operand has 187 places, 248 transitions, 3562 flow. Second operand 7 states and 631 transitions. [2022-11-20 12:36:38,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 306 transitions, 5231 flow [2022-11-20 12:36:38,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 306 transitions, 4946 flow, removed 131 selfloop flow, removed 8 redundant places. [2022-11-20 12:36:38,809 INFO L231 Difference]: Finished difference. Result has 183 places, 170 transitions, 1859 flow [2022-11-20 12:36:38,809 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=3349, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1859, PETRI_PLACES=183, PETRI_TRANSITIONS=170} [2022-11-20 12:36:38,810 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 64 predicate places. [2022-11-20 12:36:38,810 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 170 transitions, 1859 flow [2022-11-20 12:36:38,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.42857142857143) internal successors, (598), 7 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:38,811 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:36:38,811 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:38,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 12:36:38,812 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-11-20 12:36:38,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:38,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1581926470, now seen corresponding path program 2 times [2022-11-20 12:36:38,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:38,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486538145] [2022-11-20 12:36:38,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:38,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:36:39,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:39,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486538145] [2022-11-20 12:36:39,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486538145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:39,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:39,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:36:39,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129246250] [2022-11-20 12:36:39,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:39,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:36:39,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:39,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:36:39,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:36:39,124 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-11-20 12:36:39,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 170 transitions, 1859 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:39,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:36:39,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-11-20 12:36:39,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:36:40,660 INFO L130 PetriNetUnfolder]: 2152/4189 cut-off events. [2022-11-20 12:36:40,660 INFO L131 PetriNetUnfolder]: For 166937/167795 co-relation queries the response was YES. [2022-11-20 12:36:40,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31011 conditions, 4189 events. 2152/4189 cut-off events. For 166937/167795 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 30318 event pairs, 172 based on Foata normal form. 236/4218 useless extension candidates. Maximal degree in co-relation 30960. Up to 1525 conditions per place. [2022-11-20 12:36:40,715 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 84 selfloop transitions, 7 changer transitions 129/305 dead transitions. [2022-11-20 12:36:40,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 305 transitions, 5329 flow [2022-11-20 12:36:40,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:36:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 12:36:40,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 982 transitions. [2022-11-20 12:36:40,719 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8614035087719298 [2022-11-20 12:36:40,719 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 982 transitions. [2022-11-20 12:36:40,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 982 transitions. [2022-11-20 12:36:40,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:36:40,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 982 transitions. [2022-11-20 12:36:40,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.2) internal successors, (982), 10 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:40,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:40,726 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:40,726 INFO L175 Difference]: Start difference. First operand has 183 places, 170 transitions, 1859 flow. Second operand 10 states and 982 transitions. [2022-11-20 12:36:40,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 305 transitions, 5329 flow [2022-11-20 12:36:41,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 305 transitions, 4420 flow, removed 304 selfloop flow, removed 19 redundant places. [2022-11-20 12:36:41,221 INFO L231 Difference]: Finished difference. Result has 176 places, 141 transitions, 1172 flow [2022-11-20 12:36:41,222 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1172, PETRI_PLACES=176, PETRI_TRANSITIONS=141} [2022-11-20 12:36:41,222 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 57 predicate places. [2022-11-20 12:36:41,223 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 141 transitions, 1172 flow [2022-11-20 12:36:41,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:41,223 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:36:41,223 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:41,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 12:36:41,223 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-11-20 12:36:41,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:41,224 INFO L85 PathProgramCache]: Analyzing trace with hash -301252876, now seen corresponding path program 1 times [2022-11-20 12:36:41,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:41,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412830954] [2022-11-20 12:36:41,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:41,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:41,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:36:41,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:41,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412830954] [2022-11-20 12:36:41,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412830954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:41,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:41,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:36:41,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947855656] [2022-11-20 12:36:41,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:41,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:36:41,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:41,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:36:41,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:36:41,522 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-11-20 12:36:41,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 141 transitions, 1172 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:41,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:36:41,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-11-20 12:36:41,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:36:42,429 INFO L130 PetriNetUnfolder]: 897/2174 cut-off events. [2022-11-20 12:36:42,429 INFO L131 PetriNetUnfolder]: For 60971/61258 co-relation queries the response was YES. [2022-11-20 12:36:42,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14781 conditions, 2174 events. 897/2174 cut-off events. For 60971/61258 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 15851 event pairs, 99 based on Foata normal form. 133/2260 useless extension candidates. Maximal degree in co-relation 14734. Up to 677 conditions per place. [2022-11-20 12:36:42,449 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 67 selfloop transitions, 10 changer transitions 77/238 dead transitions. [2022-11-20 12:36:42,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 238 transitions, 3386 flow [2022-11-20 12:36:42,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 12:36:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 12:36:42,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1081 transitions. [2022-11-20 12:36:42,453 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8620414673046252 [2022-11-20 12:36:42,453 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1081 transitions. [2022-11-20 12:36:42,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1081 transitions. [2022-11-20 12:36:42,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:36:42,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1081 transitions. [2022-11-20 12:36:42,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.27272727272727) internal successors, (1081), 11 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:42,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:42,461 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:42,461 INFO L175 Difference]: Start difference. First operand has 176 places, 141 transitions, 1172 flow. Second operand 11 states and 1081 transitions. [2022-11-20 12:36:42,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 238 transitions, 3386 flow [2022-11-20 12:36:42,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 238 transitions, 3241 flow, removed 60 selfloop flow, removed 6 redundant places. [2022-11-20 12:36:42,542 INFO L231 Difference]: Finished difference. Result has 182 places, 134 transitions, 1038 flow [2022-11-20 12:36:42,543 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1038, PETRI_PLACES=182, PETRI_TRANSITIONS=134} [2022-11-20 12:36:42,543 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 63 predicate places. [2022-11-20 12:36:42,543 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 134 transitions, 1038 flow [2022-11-20 12:36:42,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:42,544 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:36:42,544 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:42,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 12:36:42,545 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-11-20 12:36:42,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:42,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1086869889, now seen corresponding path program 1 times [2022-11-20 12:36:42,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:42,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254555573] [2022-11-20 12:36:42,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:42,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:42,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:36:42,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:42,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254555573] [2022-11-20 12:36:42,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254555573] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:42,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:42,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:36:42,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581521763] [2022-11-20 12:36:42,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:42,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:36:42,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:42,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:36:42,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:36:42,871 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-11-20 12:36:42,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 134 transitions, 1038 flow. Second operand has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:42,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:36:42,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-11-20 12:36:42,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:36:43,595 INFO L130 PetriNetUnfolder]: 429/1271 cut-off events. [2022-11-20 12:36:43,595 INFO L131 PetriNetUnfolder]: For 30409/30485 co-relation queries the response was YES. [2022-11-20 12:36:43,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8224 conditions, 1271 events. 429/1271 cut-off events. For 30409/30485 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9318 event pairs, 61 based on Foata normal form. 47/1289 useless extension candidates. Maximal degree in co-relation 8175. Up to 348 conditions per place. [2022-11-20 12:36:43,604 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 34 selfloop transitions, 12 changer transitions 56/181 dead transitions. [2022-11-20 12:36:43,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 181 transitions, 2118 flow [2022-11-20 12:36:43,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 12:36:43,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-20 12:36:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1144 transitions. [2022-11-20 12:36:43,607 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8362573099415205 [2022-11-20 12:36:43,608 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1144 transitions. [2022-11-20 12:36:43,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1144 transitions. [2022-11-20 12:36:43,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:36:43,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1144 transitions. [2022-11-20 12:36:43,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 95.33333333333333) internal successors, (1144), 12 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:43,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:43,616 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:43,616 INFO L175 Difference]: Start difference. First operand has 182 places, 134 transitions, 1038 flow. Second operand 12 states and 1144 transitions. [2022-11-20 12:36:43,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 181 transitions, 2118 flow [2022-11-20 12:36:43,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 181 transitions, 1865 flow, removed 114 selfloop flow, removed 12 redundant places. [2022-11-20 12:36:43,682 INFO L231 Difference]: Finished difference. Result has 183 places, 113 transitions, 673 flow [2022-11-20 12:36:43,683 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=673, PETRI_PLACES=183, PETRI_TRANSITIONS=113} [2022-11-20 12:36:43,683 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 64 predicate places. [2022-11-20 12:36:43,684 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 113 transitions, 673 flow [2022-11-20 12:36:43,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:43,684 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:36:43,684 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:43,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 12:36:43,685 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:36:43,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:43,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1016635346, now seen corresponding path program 1 times [2022-11-20 12:36:43,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:43,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716884027] [2022-11-20 12:36:43,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:43,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:46,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:36:46,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:46,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716884027] [2022-11-20 12:36:46,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716884027] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:46,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:46,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 12:36:46,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767146561] [2022-11-20 12:36:46,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:46,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 12:36:46,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:46,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:36:46,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:36:46,109 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-20 12:36:46,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 113 transitions, 673 flow. Second operand has 11 states, 11 states have (on average 82.63636363636364) internal successors, (909), 11 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:46,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:36:46,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-20 12:36:46,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:36:46,611 INFO L130 PetriNetUnfolder]: 69/430 cut-off events. [2022-11-20 12:36:46,611 INFO L131 PetriNetUnfolder]: For 3230/3246 co-relation queries the response was YES. [2022-11-20 12:36:46,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1789 conditions, 430 events. 69/430 cut-off events. For 3230/3246 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2197 event pairs, 4 based on Foata normal form. 3/420 useless extension candidates. Maximal degree in co-relation 1743. Up to 83 conditions per place. [2022-11-20 12:36:46,615 INFO L137 encePairwiseOnDemand]: 101/114 looper letters, 32 selfloop transitions, 15 changer transitions 9/127 dead transitions. [2022-11-20 12:36:46,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 127 transitions, 925 flow [2022-11-20 12:36:46,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 12:36:46,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 12:36:46,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 926 transitions. [2022-11-20 12:36:46,621 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7384370015948963 [2022-11-20 12:36:46,621 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 926 transitions. [2022-11-20 12:36:46,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 926 transitions. [2022-11-20 12:36:46,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:36:46,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 926 transitions. [2022-11-20 12:36:46,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 84.18181818181819) internal successors, (926), 11 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:46,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:46,630 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:46,630 INFO L175 Difference]: Start difference. First operand has 183 places, 113 transitions, 673 flow. Second operand 11 states and 926 transitions. [2022-11-20 12:36:46,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 127 transitions, 925 flow [2022-11-20 12:36:46,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 127 transitions, 601 flow, removed 114 selfloop flow, removed 42 redundant places. [2022-11-20 12:36:46,649 INFO L231 Difference]: Finished difference. Result has 143 places, 113 transitions, 470 flow [2022-11-20 12:36:46,649 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=470, PETRI_PLACES=143, PETRI_TRANSITIONS=113} [2022-11-20 12:36:46,650 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 24 predicate places. [2022-11-20 12:36:46,650 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 113 transitions, 470 flow [2022-11-20 12:36:46,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 82.63636363636364) internal successors, (909), 11 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:46,651 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:36:46,652 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:46,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 12:36:46,652 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:36:46,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:46,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1180816198, now seen corresponding path program 2 times [2022-11-20 12:36:46,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:46,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343699910] [2022-11-20 12:36:46,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:46,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:49,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:36:49,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:49,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343699910] [2022-11-20 12:36:49,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343699910] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:49,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:49,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 12:36:49,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563949719] [2022-11-20 12:36:49,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:49,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 12:36:49,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:49,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 12:36:49,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:36:49,025 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 114 [2022-11-20 12:36:49,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 113 transitions, 470 flow. Second operand has 14 states, 14 states have (on average 79.28571428571429) internal successors, (1110), 14 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:49,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:36:49,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 114 [2022-11-20 12:36:49,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:36:49,620 INFO L130 PetriNetUnfolder]: 43/308 cut-off events. [2022-11-20 12:36:49,620 INFO L131 PetriNetUnfolder]: For 384/384 co-relation queries the response was YES. [2022-11-20 12:36:49,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 308 events. 43/308 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1223 event pairs, 6 based on Foata normal form. 1/304 useless extension candidates. Maximal degree in co-relation 718. Up to 33 conditions per place. [2022-11-20 12:36:49,623 INFO L137 encePairwiseOnDemand]: 101/114 looper letters, 33 selfloop transitions, 13 changer transitions 14/128 dead transitions. [2022-11-20 12:36:49,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 128 transitions, 664 flow [2022-11-20 12:36:49,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:36:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 12:36:49,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1054 transitions. [2022-11-20 12:36:49,626 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7112010796221323 [2022-11-20 12:36:49,626 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1054 transitions. [2022-11-20 12:36:49,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1054 transitions. [2022-11-20 12:36:49,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:36:49,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1054 transitions. [2022-11-20 12:36:49,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 81.07692307692308) internal successors, (1054), 13 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:49,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:49,634 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:49,635 INFO L175 Difference]: Start difference. First operand has 143 places, 113 transitions, 470 flow. Second operand 13 states and 1054 transitions. [2022-11-20 12:36:49,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 128 transitions, 664 flow [2022-11-20 12:36:49,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 128 transitions, 593 flow, removed 11 selfloop flow, removed 13 redundant places. [2022-11-20 12:36:49,640 INFO L231 Difference]: Finished difference. Result has 143 places, 109 transitions, 404 flow [2022-11-20 12:36:49,640 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=404, PETRI_PLACES=143, PETRI_TRANSITIONS=109} [2022-11-20 12:36:49,641 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 24 predicate places. [2022-11-20 12:36:49,641 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 109 transitions, 404 flow [2022-11-20 12:36:49,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 79.28571428571429) internal successors, (1110), 14 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:49,642 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:36:49,642 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:49,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 12:36:49,643 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:36:49,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:49,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1427982738, now seen corresponding path program 3 times [2022-11-20 12:36:49,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:49,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114888182] [2022-11-20 12:36:49,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:49,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:36:49,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:36:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:36:49,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:36:49,851 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:36:49,852 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-20 12:36:49,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-20 12:36:49,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-20 12:36:49,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-20 12:36:49,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-20 12:36:49,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-20 12:36:49,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 12:36:49,856 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:49,865 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 12:36:49,866 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:36:50,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:36:50 BasicIcfg [2022-11-20 12:36:50,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:36:50,004 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:36:50,004 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:36:50,004 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:36:50,005 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:36:08" (3/4) ... [2022-11-20 12:36:50,012 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 12:36:50,163 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854d9251-d372-4ad9-b4d7-8fa99a5fc24c/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 12:36:50,163 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:36:50,164 INFO L158 Benchmark]: Toolchain (without parser) took 44034.41ms. Allocated memory was 186.6MB in the beginning and 939.5MB in the end (delta: 752.9MB). Free memory was 137.8MB in the beginning and 743.4MB in the end (delta: -605.6MB). Peak memory consumption was 148.6MB. Max. memory is 16.1GB. [2022-11-20 12:36:50,165 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 86.1MB in the end (delta: 136.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:36:50,165 INFO L158 Benchmark]: CACSL2BoogieTranslator took 788.01ms. Allocated memory is still 186.6MB. Free memory was 137.1MB in the beginning and 114.8MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-20 12:36:50,165 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.49ms. Allocated memory is still 186.6MB. Free memory was 114.8MB in the beginning and 112.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:36:50,166 INFO L158 Benchmark]: Boogie Preprocessor took 83.09ms. Allocated memory is still 186.6MB. Free memory was 112.0MB in the beginning and 109.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:36:50,166 INFO L158 Benchmark]: RCFGBuilder took 1226.57ms. Allocated memory is still 186.6MB. Free memory was 109.9MB in the beginning and 141.4MB in the end (delta: -31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-20 12:36:50,167 INFO L158 Benchmark]: TraceAbstraction took 41662.07ms. Allocated memory was 186.6MB in the beginning and 939.5MB in the end (delta: 752.9MB). Free memory was 141.4MB in the beginning and 765.4MB in the end (delta: -624.0MB). Peak memory consumption was 130.9MB. Max. memory is 16.1GB. [2022-11-20 12:36:50,167 INFO L158 Benchmark]: Witness Printer took 159.29ms. Allocated memory is still 939.5MB. Free memory was 765.4MB in the beginning and 743.4MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-20 12:36:50,170 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.36ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 86.1MB in the end (delta: 136.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 788.01ms. Allocated memory is still 186.6MB. Free memory was 137.1MB in the beginning and 114.8MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.49ms. Allocated memory is still 186.6MB. Free memory was 114.8MB in the beginning and 112.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.09ms. Allocated memory is still 186.6MB. Free memory was 112.0MB in the beginning and 109.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1226.57ms. Allocated memory is still 186.6MB. Free memory was 109.9MB in the beginning and 141.4MB in the end (delta: -31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 41662.07ms. Allocated memory was 186.6MB in the beginning and 939.5MB in the end (delta: 752.9MB). Free memory was 141.4MB in the beginning and 765.4MB in the end (delta: -624.0MB). Peak memory consumption was 130.9MB. Max. memory is 16.1GB. * Witness Printer took 159.29ms. Allocated memory is still 939.5MB. Free memory was 765.4MB in the beginning and 743.4MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. 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] [L719] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L720] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L721] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L722] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L723] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L724] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L725] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L726] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L727] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L728] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L729] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L730] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L731] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L732] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L733] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L734] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L735] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L736] 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L737] 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2025; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2025, ((void *)0), P0, ((void *)0))=-2, t2025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2026; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2026, ((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(&t2026, ((void *)0), P1, ((void *)0))=-1, t2025={5:0}, t2026={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2027; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] FCALL, FORK 0 pthread_create(&t2027, ((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(&t2027, ((void *)0), P2, ((void *)0))=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, 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=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, 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=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] 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=1, 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=2, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, 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=2, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$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: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 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: 41.3s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 20.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1408 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1408 mSDsluCounter, 1475 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1183 mSDsCounter, 213 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2558 IncrementalHoareTripleChecker+Invalid, 2771 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 213 mSolverCounterUnsat, 292 mSDtfsCounter, 2558 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3562occurred in iteration=11, InterpolantAutomatonStates: 230, 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, 19.2s InterpolantComputationTime, 1424 NumberOfCodeBlocks, 1424 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1319 ConstructedInterpolants, 0 QuantifiedInterpolants, 10068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-20 12:36:50,196 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_854d9251-d372-4ad9-b4d7-8fa99a5fc24c/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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