./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3bf53c-9545-4061-a826-b8773a8a3bf2/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3bf53c-9545-4061-a826-b8773a8a3bf2/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3bf53c-9545-4061-a826-b8773a8a3bf2/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3bf53c-9545-4061-a826-b8773a8a3bf2/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3bf53c-9545-4061-a826-b8773a8a3bf2/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3bf53c-9545-4061-a826-b8773a8a3bf2/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 16:57:05,763 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:57:05,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:57:05,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:57:05,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:57:05,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:57:05,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:57:05,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:57:05,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:57:05,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:57:05,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:57:05,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:57:05,813 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:57:05,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:57:05,817 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:57:05,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:57:05,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:57:05,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:57:05,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:57:05,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:57:05,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:57:05,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:57:05,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:57:05,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:57:05,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:57:05,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:57:05,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:57:05,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:57:05,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:57:05,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:57:05,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:57:05,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:57:05,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:57:05,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:57:05,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:57:05,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:57:05,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:57:05,860 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:57:05,861 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:57:05,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:57:05,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:57:05,866 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3bf53c-9545-4061-a826-b8773a8a3bf2/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 16:57:05,905 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:57:05,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:57:05,906 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:57:05,906 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:57:05,907 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:57:05,907 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:57:05,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:57:05,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:57:05,909 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:57:05,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:57:05,910 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:57:05,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:57:05,911 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:57:05,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:57:05,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:57:05,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:57:05,911 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:57:05,912 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:57:05,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:57:05,912 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:57:05,912 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:57:05,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:57:05,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:57:05,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:57:05,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:57:05,913 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:57:05,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:57:05,914 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:57:05,914 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:57:05,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:57:05,915 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:57:05,915 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:57:05,915 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:57:05,916 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_8b3bf53c-9545-4061-a826-b8773a8a3bf2/bin/uautomizer-vX5HgA9Q3a/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_8b3bf53c-9545-4061-a826-b8773a8a3bf2/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 [2022-11-21 16:57:06,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:57:06,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:57:06,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:57:06,243 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:57:06,243 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:57:06,245 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3bf53c-9545-4061-a826-b8773a8a3bf2/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2022-11-21 16:57:09,206 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:57:09,478 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:57:09,478 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3bf53c-9545-4061-a826-b8773a8a3bf2/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2022-11-21 16:57:09,500 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3bf53c-9545-4061-a826-b8773a8a3bf2/bin/uautomizer-vX5HgA9Q3a/data/6218063fb/93315c9219c243b6b31cbccc6319303e/FLAGcd13ec332 [2022-11-21 16:57:09,515 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3bf53c-9545-4061-a826-b8773a8a3bf2/bin/uautomizer-vX5HgA9Q3a/data/6218063fb/93315c9219c243b6b31cbccc6319303e [2022-11-21 16:57:09,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:57:09,519 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:57:09,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:57:09,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:57:09,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:57:09,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:57:09" (1/1) ... [2022-11-21 16:57:09,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5268db08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:09, skipping insertion in model container [2022-11-21 16:57:09,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:57:09" (1/1) ... [2022-11-21 16:57:09,545 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:57:09,645 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:57:09,800 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_8b3bf53c-9545-4061-a826-b8773a8a3bf2/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2022-11-21 16:57:10,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:57:10,093 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:57:10,109 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_8b3bf53c-9545-4061-a826-b8773a8a3bf2/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2022-11-21 16:57:10,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:57:10,196 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:57:10,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:10 WrapperNode [2022-11-21 16:57:10,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:57:10,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:57:10,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:57:10,199 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:57:10,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:10" (1/1) ... [2022-11-21 16:57:10,235 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:10" (1/1) ... [2022-11-21 16:57:10,280 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2022-11-21 16:57:10,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:57:10,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:57:10,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:57:10,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:57:10,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:10" (1/1) ... [2022-11-21 16:57:10,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:10" (1/1) ... [2022-11-21 16:57:10,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:10" (1/1) ... [2022-11-21 16:57:10,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:10" (1/1) ... [2022-11-21 16:57:10,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:10" (1/1) ... [2022-11-21 16:57:10,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:10" (1/1) ... [2022-11-21 16:57:10,337 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:10" (1/1) ... [2022-11-21 16:57:10,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:10" (1/1) ... [2022-11-21 16:57:10,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:57:10,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:57:10,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:57:10,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:57:10,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:10" (1/1) ... [2022-11-21 16:57:10,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:57:10,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3bf53c-9545-4061-a826-b8773a8a3bf2/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:57:10,377 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3bf53c-9545-4061-a826-b8773a8a3bf2/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:57:10,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3bf53c-9545-4061-a826-b8773a8a3bf2/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:57:10,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:57:10,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 16:57:10,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:57:10,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:57:10,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:57:10,425 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 16:57:10,426 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 16:57:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 16:57:10,426 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 16:57:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:57:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 16:57:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:57:10,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:57:10,429 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 16:57:10,653 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:57:10,655 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:57:10,960 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:57:11,143 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:57:11,144 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 16:57:11,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:57:11 BoogieIcfgContainer [2022-11-21 16:57:11,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:57:11,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:57:11,149 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:57:11,152 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:57:11,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:57:09" (1/3) ... [2022-11-21 16:57:11,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157ec73f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:57:11, skipping insertion in model container [2022-11-21 16:57:11,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:10" (2/3) ... [2022-11-21 16:57:11,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157ec73f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:57:11, skipping insertion in model container [2022-11-21 16:57:11,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:57:11" (3/3) ... [2022-11-21 16:57:11,158 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2022-11-21 16:57:11,170 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-21 16:57:11,180 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:57:11,180 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-21 16:57:11,181 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:57:11,257 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 16:57:11,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 93 transitions, 196 flow [2022-11-21 16:57:11,440 INFO L130 PetriNetUnfolder]: 2/91 cut-off events. [2022-11-21 16:57:11,443 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:57:11,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-11-21 16:57:11,449 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 93 transitions, 196 flow [2022-11-21 16:57:11,453 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 91 transitions, 188 flow [2022-11-21 16:57:11,464 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:57:11,471 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;@39090d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:57:11,471 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-21 16:57:11,504 INFO L130 PetriNetUnfolder]: 0/55 cut-off events. [2022-11-21 16:57:11,511 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:57:11,512 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:57:11,513 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:11,514 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 16:57:11,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:11,519 INFO L85 PathProgramCache]: Analyzing trace with hash 76104434, now seen corresponding path program 1 times [2022-11-21 16:57:11,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:11,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564105300] [2022-11-21 16:57:11,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:11,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:12,145 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-21 16:57:12,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:12,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564105300] [2022-11-21 16:57:12,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564105300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:12,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:12,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:57:12,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682158183] [2022-11-21 16:57:12,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:12,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:57:12,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:12,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:57:12,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:57:12,226 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 93 [2022-11-21 16:57:12,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:12,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:57:12,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 93 [2022-11-21 16:57:12,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:57:12,358 INFO L130 PetriNetUnfolder]: 17/213 cut-off events. [2022-11-21 16:57:12,358 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-21 16:57:12,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 213 events. 17/213 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 679 event pairs, 7 based on Foata normal form. 8/209 useless extension candidates. Maximal degree in co-relation 215. Up to 27 conditions per place. [2022-11-21 16:57:12,364 INFO L137 encePairwiseOnDemand]: 88/93 looper letters, 9 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2022-11-21 16:57:12,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 90 transitions, 208 flow [2022-11-21 16:57:12,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:57:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:57:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2022-11-21 16:57:12,385 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9283154121863799 [2022-11-21 16:57:12,386 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 259 transitions. [2022-11-21 16:57:12,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 259 transitions. [2022-11-21 16:57:12,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:57:12,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 259 transitions. [2022-11-21 16:57:12,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:12,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:12,409 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:12,411 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 188 flow. Second operand 3 states and 259 transitions. [2022-11-21 16:57:12,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 90 transitions, 208 flow [2022-11-21 16:57:12,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 90 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:57:12,418 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 182 flow [2022-11-21 16:57:12,421 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2022-11-21 16:57:12,427 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, -2 predicate places. [2022-11-21 16:57:12,427 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 182 flow [2022-11-21 16:57:12,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:12,429 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:57:12,430 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:12,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:57:12,430 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 16:57:12,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:12,432 INFO L85 PathProgramCache]: Analyzing trace with hash -480828024, now seen corresponding path program 1 times [2022-11-21 16:57:12,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:12,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752841730] [2022-11-21 16:57:12,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:12,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:13,510 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-21 16:57:13,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:13,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752841730] [2022-11-21 16:57:13,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752841730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:13,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:13,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:57:13,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903030795] [2022-11-21 16:57:13,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:13,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:57:13,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:13,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:57:13,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:57:13,516 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2022-11-21 16:57:13,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 182 flow. Second operand has 9 states, 9 states have (on average 73.33333333333333) internal successors, (660), 9 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:13,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:57:13,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2022-11-21 16:57:13,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:57:14,069 INFO L130 PetriNetUnfolder]: 132/540 cut-off events. [2022-11-21 16:57:14,069 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-11-21 16:57:14,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 836 conditions, 540 events. 132/540 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3006 event pairs, 47 based on Foata normal form. 0/524 useless extension candidates. Maximal degree in co-relation 787. Up to 147 conditions per place. [2022-11-21 16:57:14,077 INFO L137 encePairwiseOnDemand]: 82/93 looper letters, 15 selfloop transitions, 9 changer transitions 47/132 dead transitions. [2022-11-21 16:57:14,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 132 transitions, 412 flow [2022-11-21 16:57:14,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 16:57:14,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-21 16:57:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1073 transitions. [2022-11-21 16:57:14,083 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8241167434715821 [2022-11-21 16:57:14,083 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1073 transitions. [2022-11-21 16:57:14,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1073 transitions. [2022-11-21 16:57:14,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:57:14,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1073 transitions. [2022-11-21 16:57:14,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 76.64285714285714) internal successors, (1073), 14 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:14,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:14,093 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:14,093 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 182 flow. Second operand 14 states and 1073 transitions. [2022-11-21 16:57:14,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 132 transitions, 412 flow [2022-11-21 16:57:14,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 132 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:57:14,098 INFO L231 Difference]: Finished difference. Result has 116 places, 83 transitions, 240 flow [2022-11-21 16:57:14,099 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=240, PETRI_PLACES=116, PETRI_TRANSITIONS=83} [2022-11-21 16:57:14,099 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 20 predicate places. [2022-11-21 16:57:14,100 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 83 transitions, 240 flow [2022-11-21 16:57:14,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 73.33333333333333) internal successors, (660), 9 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:14,100 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:57:14,101 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:14,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:57:14,102 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 16:57:14,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:14,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2078844166, now seen corresponding path program 1 times [2022-11-21 16:57:14,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:14,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676747392] [2022-11-21 16:57:14,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:14,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:14,963 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-21 16:57:14,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:14,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676747392] [2022-11-21 16:57:14,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676747392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:14,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:14,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-21 16:57:14,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708325089] [2022-11-21 16:57:14,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:14,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 16:57:14,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:14,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 16:57:14,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:57:14,969 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 93 [2022-11-21 16:57:14,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 83 transitions, 240 flow. Second operand has 11 states, 11 states have (on average 69.36363636363636) internal successors, (763), 11 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:14,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:57:14,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 93 [2022-11-21 16:57:14,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:57:15,952 INFO L130 PetriNetUnfolder]: 288/713 cut-off events. [2022-11-21 16:57:15,953 INFO L131 PetriNetUnfolder]: For 1310/1390 co-relation queries the response was YES. [2022-11-21 16:57:15,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2142 conditions, 713 events. 288/713 cut-off events. For 1310/1390 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3597 event pairs, 43 based on Foata normal form. 36/735 useless extension candidates. Maximal degree in co-relation 2077. Up to 176 conditions per place. [2022-11-21 16:57:15,959 INFO L137 encePairwiseOnDemand]: 79/93 looper letters, 33 selfloop transitions, 24 changer transitions 74/188 dead transitions. [2022-11-21 16:57:15,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 188 transitions, 1008 flow [2022-11-21 16:57:15,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-21 16:57:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-21 16:57:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1756 transitions. [2022-11-21 16:57:15,965 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7867383512544803 [2022-11-21 16:57:15,965 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 1756 transitions. [2022-11-21 16:57:15,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 1756 transitions. [2022-11-21 16:57:15,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:57:15,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1756 transitions. [2022-11-21 16:57:15,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 73.16666666666667) internal successors, (1756), 24 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:15,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 93.0) internal successors, (2325), 25 states have internal predecessors, (2325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:15,977 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 93.0) internal successors, (2325), 25 states have internal predecessors, (2325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:15,977 INFO L175 Difference]: Start difference. First operand has 116 places, 83 transitions, 240 flow. Second operand 24 states and 1756 transitions. [2022-11-21 16:57:15,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 188 transitions, 1008 flow [2022-11-21 16:57:15,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 188 transitions, 974 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-11-21 16:57:15,988 INFO L231 Difference]: Finished difference. Result has 137 places, 102 transitions, 499 flow [2022-11-21 16:57:15,988 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=499, PETRI_PLACES=137, PETRI_TRANSITIONS=102} [2022-11-21 16:57:15,989 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 41 predicate places. [2022-11-21 16:57:15,989 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 102 transitions, 499 flow [2022-11-21 16:57:15,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 69.36363636363636) internal successors, (763), 11 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:15,990 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:57:15,990 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:15,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:57:15,991 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 16:57:15,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:15,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1542349574, now seen corresponding path program 1 times [2022-11-21 16:57:15,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:15,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210392721] [2022-11-21 16:57:15,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:15,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:16,667 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-21 16:57:16,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:16,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210392721] [2022-11-21 16:57:16,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210392721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:16,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:16,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 16:57:16,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601115548] [2022-11-21 16:57:16,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:16,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:57:16,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:16,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:57:16,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:57:16,671 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 93 [2022-11-21 16:57:16,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 102 transitions, 499 flow. Second operand has 10 states, 10 states have (on average 72.4) internal successors, (724), 10 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:16,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:57:16,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 93 [2022-11-21 16:57:16,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:57:17,078 INFO L130 PetriNetUnfolder]: 133/408 cut-off events. [2022-11-21 16:57:17,078 INFO L131 PetriNetUnfolder]: For 5308/5629 co-relation queries the response was YES. [2022-11-21 16:57:17,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2170 conditions, 408 events. 133/408 cut-off events. For 5308/5629 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1816 event pairs, 33 based on Foata normal form. 19/415 useless extension candidates. Maximal degree in co-relation 2082. Up to 191 conditions per place. [2022-11-21 16:57:17,084 INFO L137 encePairwiseOnDemand]: 84/93 looper letters, 31 selfloop transitions, 9 changer transitions 19/124 dead transitions. [2022-11-21 16:57:17,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 124 transitions, 833 flow [2022-11-21 16:57:17,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 16:57:17,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-21 16:57:17,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 896 transitions. [2022-11-21 16:57:17,088 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8028673835125448 [2022-11-21 16:57:17,088 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 896 transitions. [2022-11-21 16:57:17,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 896 transitions. [2022-11-21 16:57:17,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:57:17,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 896 transitions. [2022-11-21 16:57:17,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 74.66666666666667) internal successors, (896), 12 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:17,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 93.0) internal successors, (1209), 13 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:17,094 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 93.0) internal successors, (1209), 13 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:17,094 INFO L175 Difference]: Start difference. First operand has 137 places, 102 transitions, 499 flow. Second operand 12 states and 896 transitions. [2022-11-21 16:57:17,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 124 transitions, 833 flow [2022-11-21 16:57:17,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 124 transitions, 719 flow, removed 56 selfloop flow, removed 13 redundant places. [2022-11-21 16:57:17,109 INFO L231 Difference]: Finished difference. Result has 127 places, 102 transitions, 476 flow [2022-11-21 16:57:17,109 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=476, PETRI_PLACES=127, PETRI_TRANSITIONS=102} [2022-11-21 16:57:17,110 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 31 predicate places. [2022-11-21 16:57:17,110 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 102 transitions, 476 flow [2022-11-21 16:57:17,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 72.4) internal successors, (724), 10 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:17,111 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:57:17,111 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:17,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:57:17,112 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 16:57:17,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:17,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1026892407, now seen corresponding path program 1 times [2022-11-21 16:57:17,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:17,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972116621] [2022-11-21 16:57:17,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:17,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:17,783 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-21 16:57:17,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:17,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972116621] [2022-11-21 16:57:17,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972116621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:17,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:17,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 16:57:17,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3907724] [2022-11-21 16:57:17,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:17,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:57:17,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:17,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:57:17,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:57:17,787 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 93 [2022-11-21 16:57:17,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 102 transitions, 476 flow. Second operand has 10 states, 10 states have (on average 70.6) internal successors, (706), 10 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:17,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:57:17,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 93 [2022-11-21 16:57:17,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:57:18,228 INFO L130 PetriNetUnfolder]: 131/425 cut-off events. [2022-11-21 16:57:18,229 INFO L131 PetriNetUnfolder]: For 3369/3582 co-relation queries the response was YES. [2022-11-21 16:57:18,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1915 conditions, 425 events. 131/425 cut-off events. For 3369/3582 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2020 event pairs, 47 based on Foata normal form. 26/438 useless extension candidates. Maximal degree in co-relation 1827. Up to 151 conditions per place. [2022-11-21 16:57:18,234 INFO L137 encePairwiseOnDemand]: 82/93 looper letters, 21 selfloop transitions, 19 changer transitions 24/127 dead transitions. [2022-11-21 16:57:18,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 127 transitions, 920 flow [2022-11-21 16:57:18,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 16:57:18,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-21 16:57:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 947 transitions. [2022-11-21 16:57:18,238 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7832919768403639 [2022-11-21 16:57:18,239 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 947 transitions. [2022-11-21 16:57:18,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 947 transitions. [2022-11-21 16:57:18,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:57:18,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 947 transitions. [2022-11-21 16:57:18,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 72.84615384615384) internal successors, (947), 13 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:18,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:18,246 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:18,246 INFO L175 Difference]: Start difference. First operand has 127 places, 102 transitions, 476 flow. Second operand 13 states and 947 transitions. [2022-11-21 16:57:18,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 127 transitions, 920 flow [2022-11-21 16:57:18,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 127 transitions, 795 flow, removed 55 selfloop flow, removed 16 redundant places. [2022-11-21 16:57:18,257 INFO L231 Difference]: Finished difference. Result has 124 places, 102 transitions, 520 flow [2022-11-21 16:57:18,257 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=520, PETRI_PLACES=124, PETRI_TRANSITIONS=102} [2022-11-21 16:57:18,258 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 28 predicate places. [2022-11-21 16:57:18,259 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 102 transitions, 520 flow [2022-11-21 16:57:18,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 70.6) internal successors, (706), 10 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:18,259 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:57:18,260 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:18,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:57:18,260 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 16:57:18,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:18,261 INFO L85 PathProgramCache]: Analyzing trace with hash 151579050, now seen corresponding path program 1 times [2022-11-21 16:57:18,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:18,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815870745] [2022-11-21 16:57:18,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:18,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:18,937 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-21 16:57:18,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:18,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815870745] [2022-11-21 16:57:18,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815870745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:18,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:18,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-21 16:57:18,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194233517] [2022-11-21 16:57:18,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:18,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 16:57:18,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:18,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 16:57:18,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:57:18,941 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 93 [2022-11-21 16:57:18,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 102 transitions, 520 flow. Second operand has 11 states, 11 states have (on average 71.45454545454545) internal successors, (786), 11 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:18,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:57:18,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 93 [2022-11-21 16:57:18,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:57:19,289 INFO L130 PetriNetUnfolder]: 96/345 cut-off events. [2022-11-21 16:57:19,289 INFO L131 PetriNetUnfolder]: For 2666/2963 co-relation queries the response was YES. [2022-11-21 16:57:19,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 345 events. 96/345 cut-off events. For 2666/2963 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1459 event pairs, 35 based on Foata normal form. 21/353 useless extension candidates. Maximal degree in co-relation 1375. Up to 150 conditions per place. [2022-11-21 16:57:19,293 INFO L137 encePairwiseOnDemand]: 81/93 looper letters, 32 selfloop transitions, 13 changer transitions 11/120 dead transitions. [2022-11-21 16:57:19,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 120 transitions, 798 flow [2022-11-21 16:57:19,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:57:19,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-21 16:57:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 738 transitions. [2022-11-21 16:57:19,296 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7935483870967742 [2022-11-21 16:57:19,296 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 738 transitions. [2022-11-21 16:57:19,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 738 transitions. [2022-11-21 16:57:19,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:57:19,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 738 transitions. [2022-11-21 16:57:19,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 73.8) internal successors, (738), 10 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:19,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:19,301 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:19,302 INFO L175 Difference]: Start difference. First operand has 124 places, 102 transitions, 520 flow. Second operand 10 states and 738 transitions. [2022-11-21 16:57:19,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 120 transitions, 798 flow [2022-11-21 16:57:19,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 120 transitions, 682 flow, removed 44 selfloop flow, removed 12 redundant places. [2022-11-21 16:57:19,311 INFO L231 Difference]: Finished difference. Result has 119 places, 106 transitions, 507 flow [2022-11-21 16:57:19,311 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=507, PETRI_PLACES=119, PETRI_TRANSITIONS=106} [2022-11-21 16:57:19,312 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 23 predicate places. [2022-11-21 16:57:19,312 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 106 transitions, 507 flow [2022-11-21 16:57:19,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 71.45454545454545) internal successors, (786), 11 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:19,313 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:57:19,313 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:19,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:57:19,314 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 16:57:19,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:19,314 INFO L85 PathProgramCache]: Analyzing trace with hash -374179948, now seen corresponding path program 2 times [2022-11-21 16:57:19,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:19,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103638684] [2022-11-21 16:57:19,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:19,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:20,102 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-21 16:57:20,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:20,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103638684] [2022-11-21 16:57:20,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103638684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:20,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:20,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 16:57:20,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645560505] [2022-11-21 16:57:20,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:20,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:57:20,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:20,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:57:20,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:57:20,112 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 93 [2022-11-21 16:57:20,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 106 transitions, 507 flow. Second operand has 10 states, 10 states have (on average 71.6) internal successors, (716), 10 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:20,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:57:20,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 93 [2022-11-21 16:57:20,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:57:20,500 INFO L130 PetriNetUnfolder]: 96/352 cut-off events. [2022-11-21 16:57:20,500 INFO L131 PetriNetUnfolder]: For 1514/1890 co-relation queries the response was YES. [2022-11-21 16:57:20,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1304 conditions, 352 events. 96/352 cut-off events. For 1514/1890 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1523 event pairs, 34 based on Foata normal form. 25/365 useless extension candidates. Maximal degree in co-relation 1225. Up to 152 conditions per place. [2022-11-21 16:57:20,504 INFO L137 encePairwiseOnDemand]: 82/93 looper letters, 35 selfloop transitions, 14 changer transitions 20/133 dead transitions. [2022-11-21 16:57:20,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 133 transitions, 869 flow [2022-11-21 16:57:20,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 16:57:20,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-21 16:57:20,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 889 transitions. [2022-11-21 16:57:20,517 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.796594982078853 [2022-11-21 16:57:20,518 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 889 transitions. [2022-11-21 16:57:20,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 889 transitions. [2022-11-21 16:57:20,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:57:20,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 889 transitions. [2022-11-21 16:57:20,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 74.08333333333333) internal successors, (889), 12 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:20,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 93.0) internal successors, (1209), 13 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:20,524 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 93.0) internal successors, (1209), 13 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:20,524 INFO L175 Difference]: Start difference. First operand has 119 places, 106 transitions, 507 flow. Second operand 12 states and 889 transitions. [2022-11-21 16:57:20,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 133 transitions, 869 flow [2022-11-21 16:57:20,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 133 transitions, 846 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-11-21 16:57:20,532 INFO L231 Difference]: Finished difference. Result has 130 places, 111 transitions, 594 flow [2022-11-21 16:57:20,532 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=594, PETRI_PLACES=130, PETRI_TRANSITIONS=111} [2022-11-21 16:57:20,533 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 34 predicate places. [2022-11-21 16:57:20,533 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 111 transitions, 594 flow [2022-11-21 16:57:20,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 71.6) internal successors, (716), 10 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:20,534 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:57:20,534 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:20,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:57:20,535 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 16:57:20,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:20,535 INFO L85 PathProgramCache]: Analyzing trace with hash -316194936, now seen corresponding path program 3 times [2022-11-21 16:57:20,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:20,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360577205] [2022-11-21 16:57:20,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:20,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:21,567 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-21 16:57:21,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:21,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360577205] [2022-11-21 16:57:21,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360577205] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:21,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:21,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 16:57:21,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427194902] [2022-11-21 16:57:21,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:21,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:57:21,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:21,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:57:21,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:57:21,572 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 93 [2022-11-21 16:57:21,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 111 transitions, 594 flow. Second operand has 10 states, 10 states have (on average 68.8) internal successors, (688), 10 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:21,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:57:21,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 93 [2022-11-21 16:57:21,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:57:22,222 INFO L130 PetriNetUnfolder]: 126/429 cut-off events. [2022-11-21 16:57:22,223 INFO L131 PetriNetUnfolder]: For 3442/4072 co-relation queries the response was YES. [2022-11-21 16:57:22,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2043 conditions, 429 events. 126/429 cut-off events. For 3442/4072 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2011 event pairs, 15 based on Foata normal form. 32/445 useless extension candidates. Maximal degree in co-relation 1957. Up to 121 conditions per place. [2022-11-21 16:57:22,227 INFO L137 encePairwiseOnDemand]: 81/93 looper letters, 47 selfloop transitions, 25 changer transitions 39/167 dead transitions. [2022-11-21 16:57:22,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 167 transitions, 1438 flow [2022-11-21 16:57:22,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 16:57:22,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-21 16:57:22,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1148 transitions. [2022-11-21 16:57:22,233 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.771505376344086 [2022-11-21 16:57:22,233 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1148 transitions. [2022-11-21 16:57:22,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1148 transitions. [2022-11-21 16:57:22,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:57:22,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1148 transitions. [2022-11-21 16:57:22,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 71.75) internal successors, (1148), 16 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:22,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 93.0) internal successors, (1581), 17 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:22,244 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 93.0) internal successors, (1581), 17 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:22,244 INFO L175 Difference]: Start difference. First operand has 130 places, 111 transitions, 594 flow. Second operand 16 states and 1148 transitions. [2022-11-21 16:57:22,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 167 transitions, 1438 flow [2022-11-21 16:57:22,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 167 transitions, 1388 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-11-21 16:57:22,262 INFO L231 Difference]: Finished difference. Result has 145 places, 117 transitions, 765 flow [2022-11-21 16:57:22,262 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=765, PETRI_PLACES=145, PETRI_TRANSITIONS=117} [2022-11-21 16:57:22,264 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 49 predicate places. [2022-11-21 16:57:22,264 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 117 transitions, 765 flow [2022-11-21 16:57:22,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 68.8) internal successors, (688), 10 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:22,265 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:57:22,265 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:22,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:57:22,266 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 16:57:22,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:22,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1214828588, now seen corresponding path program 1 times [2022-11-21 16:57:22,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:22,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787294431] [2022-11-21 16:57:22,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:22,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:23,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:57:23,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:23,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787294431] [2022-11-21 16:57:23,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787294431] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:23,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:23,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-21 16:57:23,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857020589] [2022-11-21 16:57:23,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:23,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-21 16:57:23,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:23,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-21 16:57:23,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:57:23,677 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 93 [2022-11-21 16:57:23,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 117 transitions, 765 flow. Second operand has 12 states, 12 states have (on average 65.83333333333333) internal successors, (790), 12 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:23,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:57:23,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 93 [2022-11-21 16:57:23,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:57:24,261 INFO L130 PetriNetUnfolder]: 78/339 cut-off events. [2022-11-21 16:57:24,261 INFO L131 PetriNetUnfolder]: For 3049/3223 co-relation queries the response was YES. [2022-11-21 16:57:24,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1675 conditions, 339 events. 78/339 cut-off events. For 3049/3223 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1485 event pairs, 20 based on Foata normal form. 23/347 useless extension candidates. Maximal degree in co-relation 1577. Up to 132 conditions per place. [2022-11-21 16:57:24,265 INFO L137 encePairwiseOnDemand]: 78/93 looper letters, 45 selfloop transitions, 30 changer transitions 20/148 dead transitions. [2022-11-21 16:57:24,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 148 transitions, 1326 flow [2022-11-21 16:57:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 16:57:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-21 16:57:24,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1023 transitions. [2022-11-21 16:57:24,270 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2022-11-21 16:57:24,270 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1023 transitions. [2022-11-21 16:57:24,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1023 transitions. [2022-11-21 16:57:24,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:57:24,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1023 transitions. [2022-11-21 16:57:24,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 68.2) internal successors, (1023), 15 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:24,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:24,284 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:24,299 INFO L175 Difference]: Start difference. First operand has 145 places, 117 transitions, 765 flow. Second operand 15 states and 1023 transitions. [2022-11-21 16:57:24,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 148 transitions, 1326 flow [2022-11-21 16:57:24,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 148 transitions, 1221 flow, removed 47 selfloop flow, removed 12 redundant places. [2022-11-21 16:57:24,317 INFO L231 Difference]: Finished difference. Result has 148 places, 121 transitions, 875 flow [2022-11-21 16:57:24,317 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=875, PETRI_PLACES=148, PETRI_TRANSITIONS=121} [2022-11-21 16:57:24,318 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 52 predicate places. [2022-11-21 16:57:24,319 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 121 transitions, 875 flow [2022-11-21 16:57:24,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 65.83333333333333) internal successors, (790), 12 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:24,319 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:57:24,320 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:24,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:57:24,320 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 16:57:24,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:24,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1836567044, now seen corresponding path program 2 times [2022-11-21 16:57:24,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:24,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277624499] [2022-11-21 16:57:24,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:24,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:25,528 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-21 16:57:25,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:25,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277624499] [2022-11-21 16:57:25,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277624499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:25,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:25,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-21 16:57:25,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352197204] [2022-11-21 16:57:25,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:25,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-21 16:57:25,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:25,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 16:57:25,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:57:25,531 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 93 [2022-11-21 16:57:25,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 121 transitions, 875 flow. Second operand has 14 states, 14 states have (on average 69.35714285714286) internal successors, (971), 14 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:25,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:57:25,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 93 [2022-11-21 16:57:25,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:57:26,093 INFO L130 PetriNetUnfolder]: 63/307 cut-off events. [2022-11-21 16:57:26,094 INFO L131 PetriNetUnfolder]: For 3535/3806 co-relation queries the response was YES. [2022-11-21 16:57:26,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1548 conditions, 307 events. 63/307 cut-off events. For 3535/3806 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1310 event pairs, 19 based on Foata normal form. 24/319 useless extension candidates. Maximal degree in co-relation 1448. Up to 116 conditions per place. [2022-11-21 16:57:26,097 INFO L137 encePairwiseOnDemand]: 81/93 looper letters, 34 selfloop transitions, 8 changer transitions 26/134 dead transitions. [2022-11-21 16:57:26,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 134 transitions, 1213 flow [2022-11-21 16:57:26,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 16:57:26,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-21 16:57:26,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1061 transitions. [2022-11-21 16:57:26,100 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.760573476702509 [2022-11-21 16:57:26,101 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1061 transitions. [2022-11-21 16:57:26,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1061 transitions. [2022-11-21 16:57:26,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:57:26,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1061 transitions. [2022-11-21 16:57:26,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 70.73333333333333) internal successors, (1061), 15 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:26,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:26,111 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:26,111 INFO L175 Difference]: Start difference. First operand has 148 places, 121 transitions, 875 flow. Second operand 15 states and 1061 transitions. [2022-11-21 16:57:26,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 134 transitions, 1213 flow [2022-11-21 16:57:26,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 134 transitions, 1134 flow, removed 28 selfloop flow, removed 12 redundant places. [2022-11-21 16:57:26,129 INFO L231 Difference]: Finished difference. Result has 151 places, 108 transitions, 735 flow [2022-11-21 16:57:26,130 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=735, PETRI_PLACES=151, PETRI_TRANSITIONS=108} [2022-11-21 16:57:26,130 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 55 predicate places. [2022-11-21 16:57:26,131 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 108 transitions, 735 flow [2022-11-21 16:57:26,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 69.35714285714286) internal successors, (971), 14 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:26,131 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:57:26,132 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:26,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 16:57:26,134 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 16:57:26,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:26,135 INFO L85 PathProgramCache]: Analyzing trace with hash 798766626, now seen corresponding path program 3 times [2022-11-21 16:57:26,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:26,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515984942] [2022-11-21 16:57:26,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:26,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:27,238 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-21 16:57:27,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:27,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515984942] [2022-11-21 16:57:27,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515984942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:27,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:27,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-21 16:57:27,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571233626] [2022-11-21 16:57:27,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:27,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-21 16:57:27,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:27,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-21 16:57:27,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-11-21 16:57:27,241 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 93 [2022-11-21 16:57:27,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 108 transitions, 735 flow. Second operand has 15 states, 15 states have (on average 64.46666666666667) internal successors, (967), 15 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:27,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:57:27,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 93 [2022-11-21 16:57:27,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:57:28,146 INFO L130 PetriNetUnfolder]: 241/701 cut-off events. [2022-11-21 16:57:28,146 INFO L131 PetriNetUnfolder]: For 6540/6671 co-relation queries the response was YES. [2022-11-21 16:57:28,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2968 conditions, 701 events. 241/701 cut-off events. For 6540/6671 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4070 event pairs, 7 based on Foata normal form. 43/740 useless extension candidates. Maximal degree in co-relation 2864. Up to 118 conditions per place. [2022-11-21 16:57:28,153 INFO L137 encePairwiseOnDemand]: 79/93 looper letters, 54 selfloop transitions, 20 changer transitions 57/189 dead transitions. [2022-11-21 16:57:28,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 189 transitions, 1826 flow [2022-11-21 16:57:28,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-21 16:57:28,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-11-21 16:57:28,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1555 transitions. [2022-11-21 16:57:28,157 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7269752220663862 [2022-11-21 16:57:28,157 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1555 transitions. [2022-11-21 16:57:28,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1555 transitions. [2022-11-21 16:57:28,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:57:28,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1555 transitions. [2022-11-21 16:57:28,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 67.6086956521739) internal successors, (1555), 23 states have internal predecessors, (1555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:28,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 93.0) internal successors, (2232), 24 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:28,166 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 93.0) internal successors, (2232), 24 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:28,166 INFO L175 Difference]: Start difference. First operand has 151 places, 108 transitions, 735 flow. Second operand 23 states and 1555 transitions. [2022-11-21 16:57:28,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 189 transitions, 1826 flow [2022-11-21 16:57:28,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 189 transitions, 1517 flow, removed 140 selfloop flow, removed 20 redundant places. [2022-11-21 16:57:28,196 INFO L231 Difference]: Finished difference. Result has 154 places, 108 transitions, 762 flow [2022-11-21 16:57:28,197 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=762, PETRI_PLACES=154, PETRI_TRANSITIONS=108} [2022-11-21 16:57:28,198 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 58 predicate places. [2022-11-21 16:57:28,198 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 108 transitions, 762 flow [2022-11-21 16:57:28,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 64.46666666666667) internal successors, (967), 15 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:28,199 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:57:28,199 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:28,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 16:57:28,201 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 16:57:28,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:28,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1170273642, now seen corresponding path program 1 times [2022-11-21 16:57:28,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:28,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773588699] [2022-11-21 16:57:28,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:28,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:28,594 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-21 16:57:28,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:28,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773588699] [2022-11-21 16:57:28,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773588699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:28,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:28,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:57:28,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599678571] [2022-11-21 16:57:28,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:28,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:57:28,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:28,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:57:28,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:57:28,598 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 93 [2022-11-21 16:57:28,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 108 transitions, 762 flow. Second operand has 8 states, 8 states have (on average 71.0) internal successors, (568), 8 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:28,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:57:28,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 93 [2022-11-21 16:57:28,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:57:29,051 INFO L130 PetriNetUnfolder]: 208/581 cut-off events. [2022-11-21 16:57:29,051 INFO L131 PetriNetUnfolder]: For 6546/6702 co-relation queries the response was YES. [2022-11-21 16:57:29,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2822 conditions, 581 events. 208/581 cut-off events. For 6546/6702 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2989 event pairs, 9 based on Foata normal form. 48/613 useless extension candidates. Maximal degree in co-relation 2722. Up to 128 conditions per place. [2022-11-21 16:57:29,056 INFO L137 encePairwiseOnDemand]: 80/93 looper letters, 21 selfloop transitions, 12 changer transitions 64/156 dead transitions. [2022-11-21 16:57:29,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 156 transitions, 1423 flow [2022-11-21 16:57:29,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 16:57:29,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-21 16:57:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1183 transitions. [2022-11-21 16:57:29,059 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7950268817204301 [2022-11-21 16:57:29,059 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1183 transitions. [2022-11-21 16:57:29,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1183 transitions. [2022-11-21 16:57:29,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:57:29,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1183 transitions. [2022-11-21 16:57:29,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 73.9375) internal successors, (1183), 16 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:29,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 93.0) internal successors, (1581), 17 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:29,089 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 93.0) internal successors, (1581), 17 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:29,089 INFO L175 Difference]: Start difference. First operand has 154 places, 108 transitions, 762 flow. Second operand 16 states and 1183 transitions. [2022-11-21 16:57:29,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 156 transitions, 1423 flow [2022-11-21 16:57:29,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 156 transitions, 1123 flow, removed 101 selfloop flow, removed 31 redundant places. [2022-11-21 16:57:29,104 INFO L231 Difference]: Finished difference. Result has 138 places, 87 transitions, 448 flow [2022-11-21 16:57:29,105 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=448, PETRI_PLACES=138, PETRI_TRANSITIONS=87} [2022-11-21 16:57:29,106 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 42 predicate places. [2022-11-21 16:57:29,106 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 87 transitions, 448 flow [2022-11-21 16:57:29,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 71.0) internal successors, (568), 8 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:29,107 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:57:29,107 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:29,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 16:57:29,108 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 16:57:29,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:29,108 INFO L85 PathProgramCache]: Analyzing trace with hash 826099005, now seen corresponding path program 1 times [2022-11-21 16:57:29,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:29,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347017770] [2022-11-21 16:57:29,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:29,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:29,321 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-21 16:57:29,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:29,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347017770] [2022-11-21 16:57:29,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347017770] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:29,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:29,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:57:29,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418891500] [2022-11-21 16:57:29,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:29,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:57:29,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:29,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:57:29,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:57:29,326 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2022-11-21 16:57:29,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 87 transitions, 448 flow. Second operand has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:29,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:57:29,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2022-11-21 16:57:29,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:57:29,520 INFO L130 PetriNetUnfolder]: 27/181 cut-off events. [2022-11-21 16:57:29,521 INFO L131 PetriNetUnfolder]: For 953/957 co-relation queries the response was YES. [2022-11-21 16:57:29,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 181 events. 27/181 cut-off events. For 953/957 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 556 event pairs, 1 based on Foata normal form. 13/194 useless extension candidates. Maximal degree in co-relation 636. Up to 22 conditions per place. [2022-11-21 16:57:29,522 INFO L137 encePairwiseOnDemand]: 85/93 looper letters, 15 selfloop transitions, 8 changer transitions 22/105 dead transitions. [2022-11-21 16:57:29,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 105 transitions, 731 flow [2022-11-21 16:57:29,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:57:29,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-21 16:57:29,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 757 transitions. [2022-11-21 16:57:29,528 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8139784946236559 [2022-11-21 16:57:29,528 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 757 transitions. [2022-11-21 16:57:29,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 757 transitions. [2022-11-21 16:57:29,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:57:29,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 757 transitions. [2022-11-21 16:57:29,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 75.7) internal successors, (757), 10 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:29,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:29,532 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:29,532 INFO L175 Difference]: Start difference. First operand has 138 places, 87 transitions, 448 flow. Second operand 10 states and 757 transitions. [2022-11-21 16:57:29,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 105 transitions, 731 flow [2022-11-21 16:57:29,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 105 transitions, 534 flow, removed 84 selfloop flow, removed 21 redundant places. [2022-11-21 16:57:29,538 INFO L231 Difference]: Finished difference. Result has 122 places, 82 transitions, 318 flow [2022-11-21 16:57:29,539 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=318, PETRI_PLACES=122, PETRI_TRANSITIONS=82} [2022-11-21 16:57:29,540 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 26 predicate places. [2022-11-21 16:57:29,541 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 82 transitions, 318 flow [2022-11-21 16:57:29,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:29,557 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:57:29,557 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:29,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 16:57:29,557 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 16:57:29,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:29,558 INFO L85 PathProgramCache]: Analyzing trace with hash -712284181, now seen corresponding path program 1 times [2022-11-21 16:57:29,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:29,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599067818] [2022-11-21 16:57:29,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:29,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:57:29,605 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:57:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:57:29,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:57:29,702 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:57:29,704 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-21 16:57:29,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-21 16:57:29,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-21 16:57:29,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-21 16:57:29,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-21 16:57:29,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 16:57:29,708 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:29,714 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 16:57:29,715 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:57:29,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:57:29 BasicIcfg [2022-11-21 16:57:29,828 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:57:29,829 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:57:29,829 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:57:29,829 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:57:29,830 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:57:11" (3/4) ... [2022-11-21 16:57:29,832 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-21 16:57:29,901 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3bf53c-9545-4061-a826-b8773a8a3bf2/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 16:57:29,902 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:57:29,902 INFO L158 Benchmark]: Toolchain (without parser) took 20383.53ms. Allocated memory was 155.2MB in the beginning and 459.3MB in the end (delta: 304.1MB). Free memory was 119.5MB in the beginning and 270.9MB in the end (delta: -151.4MB). Peak memory consumption was 152.4MB. Max. memory is 16.1GB. [2022-11-21 16:57:29,903 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 121.6MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:57:29,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 677.35ms. Allocated memory is still 155.2MB. Free memory was 118.8MB in the beginning and 105.3MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-21 16:57:29,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.41ms. Allocated memory is still 155.2MB. Free memory was 105.3MB in the beginning and 103.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:57:29,904 INFO L158 Benchmark]: Boogie Preprocessor took 60.43ms. Allocated memory is still 155.2MB. Free memory was 103.3MB in the beginning and 101.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:57:29,904 INFO L158 Benchmark]: RCFGBuilder took 804.06ms. Allocated memory is still 155.2MB. Free memory was 101.2MB in the beginning and 70.5MB in the end (delta: 30.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-21 16:57:29,904 INFO L158 Benchmark]: TraceAbstraction took 18679.59ms. Allocated memory was 155.2MB in the beginning and 459.3MB in the end (delta: 304.1MB). Free memory was 69.8MB in the beginning and 285.7MB in the end (delta: -215.9MB). Peak memory consumption was 90.8MB. Max. memory is 16.1GB. [2022-11-21 16:57:29,905 INFO L158 Benchmark]: Witness Printer took 72.89ms. Allocated memory is still 459.3MB. Free memory was 285.7MB in the beginning and 270.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-21 16:57:29,906 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.26ms. Allocated memory is still 121.6MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 677.35ms. Allocated memory is still 155.2MB. Free memory was 118.8MB in the beginning and 105.3MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.41ms. Allocated memory is still 155.2MB. Free memory was 105.3MB in the beginning and 103.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.43ms. Allocated memory is still 155.2MB. Free memory was 103.3MB in the beginning and 101.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 804.06ms. Allocated memory is still 155.2MB. Free memory was 101.2MB in the beginning and 70.5MB in the end (delta: 30.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 18679.59ms. Allocated memory was 155.2MB in the beginning and 459.3MB in the end (delta: 304.1MB). Free memory was 69.8MB in the beginning and 285.7MB in the end (delta: -215.9MB). Peak memory consumption was 90.8MB. Max. memory is 16.1GB. * Witness Printer took 72.89ms. Allocated memory is still 459.3MB. Free memory was 285.7MB in the beginning and 270.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. 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: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L713] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L714] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L715] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L716] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L717] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L718] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L719] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L720] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L721] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L722] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L723] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L724] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L725] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L726] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] 0 pthread_t t2475; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2475, ((void *)0), P0, ((void *)0))=-1, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t2476; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2476, ((void *)0), P1, ((void *)0))=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 111 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 813 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 813 mSDsluCounter, 910 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 751 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1880 IncrementalHoareTripleChecker+Invalid, 2033 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 159 mSDtfsCounter, 1880 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=875occurred in iteration=9, InterpolantAutomatonStates: 183, 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.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 918 NumberOfCodeBlocks, 918 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 833 ConstructedInterpolants, 0 QuantifiedInterpolants, 6120 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-21 16:57:29,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3bf53c-9545-4061-a826-b8773a8a3bf2/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE